194 search results - page 24 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
196
click to vote
CP
2009
Springer
16 years 11 days ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
ICLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
100
click to vote
IJCAI
1989
15 years 27 days ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
ECSQARU
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...