79 search results - page 13 / 16 » Arc-Consistency and Arc-Consistency Again |
160
click to vote
CPAIOR
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
171
click to vote
SAT
2009
Springer
16 years 17 days ago
2009
Springer
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [ES06] in that ...
128
click to vote
CP
2007
Springer
16 years 6 days ago
2007
Springer
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
147
click to vote
CP
2007
Springer
16 years 6 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
143
click to vote
CPAIOR
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...