561 search results - page 84 / 113 » Slicing of Constraint Logic Programs |
JCP
2006
14 years 9 months ago
2006
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...
ICALT
2008
IEEE
15 years 4 months ago
2008
IEEE
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
173
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
147
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...