Conservative constraint satisfaction re-revisited

Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way. Problems of this type are well studied for graph homomorphisms. A dichotomy theorem characterizing conservative CSPs solvable in polynomial time and proving that the remaining ones are NP-complete was proved by Bulatov (2003) in 4. Its proof, however, is quite long and technical. A shorter proof of this result based on the absorbing subuniverses technique was suggested by Barto (2011) in 1. In this paper we give a short elementary proof of the dichotomy theorem for conservative CSPs.

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

[2]  Ralph Freese,et al.  On the Complexity of Some Maltsev Conditions , 2009, Int. J. Algebra Comput..

[3]  Libor Barto,et al.  The Dichotomy for Conservative Constraint Satisfaction Problems Revisited , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

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

[5]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[6]  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..

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

[8]  P. Hell,et al.  Sparse pseudo-random graphs are Hamiltonian , 2003 .

[9]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[10]  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..

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

[12]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[13]  Zsolt Tuza,et al.  Algorithmic complexity of list colorings , 1994, Discret. Appl. Math..

[14]  Víctor Dalmau,et al.  Generalized majority-minority operations are tractable , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[15]  Pawel M. Idziak,et al.  Tractability and learnability arising from algebras with few subpowers , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

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

[17]  Pavol Hell,et al.  List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.

[18]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[19]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[20]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[21]  Andrei A. Bulatov,et al.  Complexity of conservative constraint satisfaction problems , 2011, TOCL.

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