20 search results - page 1 / 4 » The Log-Support Encoding of CSP into SAT |
CP
2007
Springer
14 years 1 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...
AAAI
2007
13 years 9 months ago
2007
Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this...
AIMSA
2008
Springer
13 years 9 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 ...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We define new encodings from Max-CSP into Partial MaxSAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality co...
CP
2004
Springer
13 years 10 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...