A Proof of CSP Dichotomy Conjecture

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parametrize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a core of a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete.In the paper we present an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.

[1]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[2]  Manuel Bodirsky,et al.  Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.

[3]  Pawel M. Idziak,et al.  Tractability and Learnability Arising from Algebras with Few Subpowers , 2010, SIAM J. Comput..

[4]  Dmitriy Zhuk.  The cardinality of the set of all clones containing a given minimal clone on three elements , 2012 .

[5]  Libor Barto,et al.  Deciding absorption , 2015, Int. J. Algebra Comput..

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

[7]  Lefteris M. Kirousis,et al.  Fast Parallel Constraint Satisfaction , 1993, Artif. Intell..

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

[9]  Dmitriy Zhuk.  The predicate method to construct the Post lattice , 2011 .

[10]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

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

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

[13]  Tomás Feder,et al.  Dichotomy for Digraph Homomorphism Problems , 2017, ArXiv.

[14]  Venkatesan Guruswami,et al.  Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy , 2018, SODA.

[15]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[16]  Jakub Bulín,et al.  Algebraic approach to promise constraint satisfaction , 2018, STOC.

[17]  Manuel Bodirsky,et al.  A Dichotomy for First-Order Reducts of Unary Structures , 2016, Log. Methods Comput. Sci..

[18]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .

[19]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2010, JACM.

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

[21]  References , 1971 .

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

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

[24]  Barnaby Martin.  Quantified Constraints in Twenty Seventeen. , 2017 .

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

[26]  Hubie Chen.  An algebraic hardness criterion for surjective constraint satisfaction , 2014, ArXiv.

[27]  Dmitriy Zhuk.  The existence of a near-unanimity function is decidable , 2011 .

[28]  Marcin Kozik.  Weak consistency notions for all the CSPs of bounded width∗ , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[29]  Libor Barto,et al.  Polymorphisms, and How to Use Them , 2017, The Constraint Satisfaction Problem.

[30]  Libor Barto,et al.  Near Unanimity Constraints Have Bounded Pathwidth Duality , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[31]  Libor Barto,et al.  The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[32]  Andrei A. Bulatov,et al.  Recent Results on the Algebraic Approach to the CSP , 2008, Complexity of Constraints.

[33]  Keith A. Kearnes,et al.  Clones of Algebras with Parallelogram Terms , 2012, Int. J. Algebra Comput..

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

[35]  Manuel Bodirsky,et al.  Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[36]  Dmitriy Zhuk,et al.  A modification of the CSP algorithm for infinite languages , 2018, 1803.07465.

[37]  Martin C. Cooper,et al.  Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[38]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[39]  Manuel Bodirsky,et al.  Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.

[40]  Hubie Chen.  Meditations on Quantified Constraint Satisfaction , 2012, Logic and Program Semantics.

[41]  Barnaby Martin,et al.  The Complexity of Quantified Constraints Using the Algebraic Formulation , 2017, MFCS.

[42]  Peter Kulchyski.  and , 2015 .

[43]  Libor Barto,et al.  Absorption in Universal Algebra and CSP. , 2017 .

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

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

[46]  Peter Jeavons,et al.  The complexity of constraint satisfaction games and QCSP , 2009, Inf. Comput..

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

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

[49]  L. A. Kaluzhnin,et al.  Galois theory for post algebras. I , 1969 .

[50]  Dmitriy Zhuk.  The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic , 2011, 2011 41st IEEE International Symposium on Multiple-Valued Logic.

[51]  C. Bergman,et al.  Universal Algebra: Fundamentals and Selected Topics , 2011 .

[52]  Hubie Chen,et al.  The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case , 2006, SIAM J. Comput..

[53]  M. Istinger,et al.  A characterization of polynomially complete algebras , 1979 .

[54]  Dmitriy Zhuk.  Key (critical) relations preserved by a weak near-unanimity function , 2015 .

[55]  Manuel Bodirsky,et al.  Constraint Satisfaction Problems over Numeric Domains , 2017 .