Sciweavers

382 search results - page 59 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
JCP
2006
91views more  JCP 2006»
15 years 6 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
199
Voted
IFIP
2004
Springer
15 years 11 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
209
Voted
MCMASTER
1993
15 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
GPCE
2009
Springer
15 years 9 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen
CHI
2011
ACM
14 years 9 months ago
Materializing the query with facet-streams: a hybrid surface for collaborative search on tabletops
We introduce “Facet-Streams”, a hybrid interactive surface for co-located collaborative product search on a tabletop. Facet-Streams combines techniques of information visualiz...
Hans-Christian Jetter, Jens Gerken, Michael Zö...