The Dichotomy for Conservative Constraint Satisfaction Problems Revisited

A central open question in the study of non-uniform constraint satisfaction problems (CSPs) is the dichotomy conjecture of Feder and Vardi stating that the CSP over a fixed constraint language is either NP-complete, or tractable. One of the main achievements in this direction is a result of Bulatov (LICS'03) confirming the dichotomy conjecture for conservative CSPs, that is, CSPs over constraint languages containing all unary relations. Unfortunately, the proof is very long and complicated, and therefore hard to understand even for a specialist. This paper provides a short and transparent proof.

[1]  Pavol Hell,et al.  The dichotomy of list homomorphisms for digraphs , 2011, SODA '11.

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

[3]  Pavol Hell,et al.  Bi-arc graphs and the complexity of list homomorphisms , 2003, J. Graph Theory.

[4]  Vladimir Kolmogorov,et al.  The complexity of conservative finite-valued CSPs , 2010, ArXiv.

[5]  Libor Barto,et al.  Constraint Satisfaction Problems of Bounded Width , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

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

[7]  Andrei A. Bulatov,et al.  A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..

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

[9]  Andrei A. Bulatov,et al.  Mal'tsev constraints are tractable , 2002, Electron. Colloquium Comput. Complex..

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

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

[12]  Libor Barto,et al.  Graphs, polymorphisms and the complexity of homomorphism problems , 2008, STOC '08.

[13]  Pascal Tesson,et al.  The Complexity of the List Homomorphism Problem for Graphs , 2011, Theory of Computing Systems.

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

[15]  Libor Barto,et al.  Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem , 2012, Log. Methods Comput. Sci..

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

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

[18]  Libor Barto,et al.  Congruence Distributivity Implies Bounded Width , 2009, SIAM J. Comput..

[19]  Libor Barto,et al.  The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) , 2008, SIAM J. Comput..

[20]  Libor Barto,et al.  New Conditions for Taylor Varieties and CSP , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

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

[22]  Rustem Takhanov,et al.  A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem , 2007, STACS.

[23]  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).

[24]  M. Maróti,et al.  Existence theorems for weakly symmetric operations , 2008 .