(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability

The constraint satisfaction problem (CSP) can be formulated as the problem of deciding, given a pair (A,B) of relational structures, whether or not there is a homomorphism from A to B. Although the CSP is in general intractable, it may be restricted by requiring the "target structure" B to be fixed; denote this restriction by CSP(B). In recent years, much effort has been directed towards classifying the complexity of all problems CSP(B). The acquisition of CSP(B) tractability results has generally proceeded by isolating a class of relational structures B believed to be tractable, and then demonstrating a polynomial-time algorithm for the class. In this paper, we introduce a new approach to obtaining CSP(B) tractability results: instead of starting with a class of structures, we start with an algorithm called look-ahead arc consistency, and give an algebraic characterization of the structures solvable by our algorithm. This characterization is used both to identify new tractable structures and to give new proofs of known tractable structures.

[1]  Peter Jeavons,et al.  Tractable constraints closed under a binary operation , 2000 .

[2]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[3]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[4]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[5]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[6]  Alvaro del Val.  On 2-SAT and Renamable Horn , 2000, AAAI/IAAI.

[7]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[8]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[9]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[10]  P. Jeavons.  Algebraic structures in combinatorial problems , 2001 .

[11]  Phokion G. Kolaitis,et al.  A Game-Theoretic Approach to Constraint Satisfaction , 2000, AAAI/IAAI.

[12]  Peter Jeavons,et al.  Constraint Satisfaction Problems and Finite Algebras , 2000, ICALP.

[13]  Peter Jeavons,et al.  An Algebraic Approach to Multi-sorted Constraints , 2003, CP.

[14]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..