151 search results - page 1 / 31 » Propagation in CSP and SAT |
AIMSA
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding ...
CP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
CP
2007
Springer
13 years 11 months 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...
ENTCS
2008
13 years 5 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
CP
2004
Springer
13 years 9 months ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...