An Algorithm for Constraint Satisfaction Problem

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 theform of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The mainproblem 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]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[16]  Lefteris M. Kirousis.  Fast Parallel Constraint Satisfaction , 1993, ICALP.

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

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

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