Dealing with Satisfiability and n-ary CSPs in a Logical Framework

We investigate in this work a generalization of the known CNF representation that we call General Normal Form (GNF) and extend the resolution rule of Robinson to design a new sound and complete resolution proof system for the GNF. We show that by using a cardinality operator in the GNF we obtain the new representation CGNF that allows a natural and efficient Boolean encoding for n-ary finite discrete extensional CSPs. We prove that the space complexity of a CSP encoded in the CGNF is identical to its space complexity when it is expressed in the classical CSP representation. We prove that the generalized resolution rule applies for the CGNF encoding and introduce a new inference rule whose application until saturation achieves arc-consistency in a linear time complexity for n-ary CSP expressed in the CGNF encoding. Two enumerative methods for solving CSP instances encoded in this Boolean framework are studied: the first one (equivalent to MAC in CSPs) maintains full arc-consistency at each node of the search tree while the second (equivalent to FC in CSPs) performs partial arc-consistency on each node. Both methods are experimented and compared on some instances of the Ramsey problem, randomly generated 3/4-ary CSPs and promising results are obtained. We also adapted the notion of clause learning defined in SAT for the CGNF encoding. Finally, we show how the proposed inference rule can be used to achieve Path-consistency in the case of binary CSPs encoded in CGNF, and how it can be used to enforce strong path consistency when it is combined with the generalized resolution rule.

[1]  Zvi Galil,et al.  On the validity and complexity of bounded resolution , 1975, STOC.

[2]  Simon Kasif,et al.  On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks , 1990, Artif. Intell..

[3]  Roland H. C. Yap,et al.  Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints , 2008, CP.

[4]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[5]  Eugene C. Freuder,et al.  Understanding and Improving the MAC Algorithm , 1997, CP.

[6]  Christian Bessiere,et al.  Optimal and Suboptimal Singleton Arc Consistency Algorithms , 2005, IJCAI.

[7]  Toby Walsh,et al.  CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[8]  Christophe Lecoutre,et al.  Generalized Arc Consistency for Positive Table Constraints , 2006, CP.

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

[10]  Christian Bessiere,et al.  Proceedings of the 13th international conference on Principles and practice of constraint programming , 2007 .

[11]  Toby Walsh,et al.  Random Constraint Satisfaction: Flaws and Structure , 2004, Constraints.

[12]  Hachemi Bennaceur.  The Satisfiability Problem Regarded as a Constraint Satisfaction Problem , 1996, ECAI.

[13]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[14]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[15]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

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

[17]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[18]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[19]  Johan de Kleer,et al.  A Comparison of ATMS and CSP Techniques , 1989, IJCAI.

[20]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[21]  Lakhdar Sais,et al.  A Generalized Framework for Conflict Analysis , 2008, SAT.

[22]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[23]  Ian P. Gent,et al.  Data Structures for Generalised Arc Consistency for Extensional Constraints , 2007, AAAI.

[24]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

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

[26]  Toby Walsh,et al.  Singleton Consistencies , 2000, CP.

[27]  Lakhdar Sais,et al.  Two Proof Procedures for a Cardinality Based Language in Propositional Calculus , 1994, STACS.

[28]  Wei Li,et al.  Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..

[29]  Toby Walsh,et al.  A Compression Algorithm for Large Arity Extensional Constraints , 2007, CP.

[30]  Frédéric Benhamou,et al.  Proceedings of the 12th international conference on Principles and Practice of Constraint Programming , 2006 .

[31]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[32]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[33]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.