A Comparison between SAT and CSP Techniques

The aim of this paper is to establish a connection between the propositional logic and the constraint based reasoning frameworks. This work is based on a translation of the satisfiability problem (SAT) into the binary constraint-satisfaction problem (CSP). The structure of the SAT problem and its associated CSP are then exploited together for characterizing tractable SAT problems, increasing the effectiveness of the classical reduction rules: unit clause and monotone literal rules, and expressing the arc and path consistency concepts with logical inference rules. This study leads to compare the behaviors of the DP and MAC procedures for solving respectively a SAT instance and its binary CSP expression.

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

[2]  Hachemi Bennaceur,et al.  An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference , 1993, Inf. Process. Lett..

[3]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

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

[5]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

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

[7]  John N. Hooker,et al.  A quantitative approach to logical inference , 1988, Decis. Support Syst..

[8]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[9]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[10]  Mukesh Dalal.  Tractable Deduction in Knowledge Representation Systems , 1992, KR.

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

[12]  Boi Faltings,et al.  Structuring Techniques for Constraint Satisfaction Problems , 1997, IJCAI.

[13]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[14]  Peter van Beek,et al.  On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[15]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[16]  Jinchang Wang,et al.  Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.

[17]  John N. Hooker,et al.  Branch-and-cut solution of inference problems in propositional logic , 2005, Annals of Mathematics and Artificial Intelligence.

[18]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[19]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[20]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[21]  Philippe Jégou,et al.  On the relations between SAT and CSP enumerative algorithms , 2000, Discret. Appl. Math..