Mapping CSP into Many-Valued SAT

We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and prove that it is refutation complete for many-valued CNF formulas and, moreover, enforces CSP (i, j)-consistency when applied to a many-valued SAT encoding of a CSP. Instances of our rule enforce well-known local consistency properties such as arc consistency and path consistency.

[1]  Dov M. Gabbay,et al.  Labelled deduction , 2000 .

[2]  Maria Luisa Bonet,et al.  The Logic Behind Weighted CSP , 2007, IJCAI.

[3]  Carlos Ansótegui,et al.  Boosting Chaff's Performance by Incorporating CSP Heuristics , 2003, CP.

[4]  Zbigniew W. Ras,et al.  Methodologies for Intelligent Systems , 1991, Lecture Notes in Computer Science.

[5]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

[6]  Alan M. Frisch,et al.  Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings , 2001, Journal of Automated Reasoning.

[7]  Reiner Hähnle,et al.  The SAT problem of signed CNF formulas , 2000 .

[8]  Bernhard Beckert,et al.  Transformations between signed and classical clause logic , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

[9]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[10]  Reiner Hähnle,et al.  Short CNF in Finitely-Valued Logics , 1993, ISMIS.

[11]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.

[12]  Armin Biere,et al.  Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.

[13]  Rina Dechter,et al.  Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.

[14]  Toby Walsh,et al.  Local Consistencies in SAT , 2003, SAT.

[15]  Fahiem Bacchus.  CSPs: Adding Structure to SAT , 2006, SAT.

[16]  Reiner Hähnle.  Efficient Deduction in Many-Valued Logics , 1994, ISMVL.

[17]  Carlos Ansótegui,et al.  Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.

[18]  Yannis Dimopoulos,et al.  Propagation in CSP and SAT , 2006, CP.

[19]  Frédéric Benhamou.  Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings , 2006, CP.