Constraint satisfaction problems (CSP) or Boolean satisfiability problem (SAT) are two well known paradigm to model and solve combinatorial problems. Modeling and resolution of CSP is often strengthened by global constraints (e.g., Alldiff constraint). This paper highlights two different ways of handling specific structural information: a uniform propagation framework to handle (interleaved) Alldiff constraints with some CSP reduction rules; and a SAT encoding of these rules that preserves the reduction properties of CSP. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lardeux, F., Monfroy, E., Saubion, F., Crawford, B., & Castro, C. (2009). SAT encoding and CSP reduction for interconnected alldiff constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5845 LNAI, pp. 360–371). https://doi.org/10.1007/978-3-642-05258-3_32
Mendeley helps you to discover research relevant for your work.