Asking the Metaquestions in Constraint Tractability

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of the CSP is as the problem of deciding, given a pair (G ℍ) of relational structures, whether or not there is a homomorphism from the first structure to the second structure. The CSP is generally NP-hard; a common way to restrict this problem is to fix the second structure ℍ so that each structure ℍ gives rise to a problem CSP(ℍ). The problem family CSP(ℍ) has been studied using an algebraic approach, which links the algorithmic and complexity properties of each problem CSP(ℍ) to a set of operations, the so-called polymorphisms of ℍ. Certain types of polymorphisms are known to imply the polynomial-time tractability of CSP(ℍ), and others are conjectured to do so. This article systematically studies—for various classes of polymorphisms—the computational complexity of deciding whether or not a given structure ℍ admits a polymorphism from the class. Among other results, we prove the NP-completeness of deciding a condition conjectured to characterize the tractable problems CSP(ℍ), as well as the NP-completeness of deciding if CSP(ℍ) has bounded width.

[1]  Alexandr Kazda,et al.  Maltsev digraphs have a majority polymorphism , 2009, Eur. J. Comb..

[2]  R. McKenzie,et al.  Optimal strong Mal’cev conditions for omitting type 1 in locally finite varieties , 2014 .

[3]  Libor Barto,et al.  The wonderland of reflections , 2015, Israel Journal of Mathematics.

[4]  R. Willard,et al.  Characterizations of several Maltsev conditions , 2015 .

[5]  Hubie Chen,et al.  Quantified constraint satisfaction and the polynomially generated powers property , 2008, ICALP.

[6]  Hubie Chen,et al.  Generic expression hardness results for primitive positive formula comparison , 2011, Inf. Comput..

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

[8]  Neil Immerman,et al.  The complexity of satisfiability problems: Refining Schaefer's theorem , 2009, J. Comput. Syst. Sci..

[9]  Hubie Chen.  Quantified constraint satisfaction and the polynomially generated powers property , 2011 .

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

[11]  Manuel Bodirsky,et al.  Qualitative Temporal and Spatial Reasoning Revisited , 2007, J. Log. Comput..

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

[13]  Tomás Feder.  Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability , 2001, SIAM J. Discret. Math..

[14]  Alexandr Kazda,et al.  CSP for binary conservative relational structures , 2011, 1112.1099.

[15]  Justin Pearson,et al.  Closure Functions and Width 1 Problems , 1999, CP.

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

[17]  L. Barto,et al.  Mal’tsev conditions, lack of absorption, and solvability , 2015 .

[18]  Andrei A. Krokhin,et al.  Robust Satisfiability for CSPs: Hardness and Algorithmic Results , 2013, TOCT.

[19]  M. Valeriote.  A Subalgebra Intersection Property for Congruence Distributive Varieties , 2009, Canadian Journal of Mathematics.

[20]  Libor Barto,et al.  The collapse of the bounded width hierarchy , 2016, J. Log. Comput..

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

[22]  Manuel Bodirsky,et al.  Qualitative Temporal and Spatial Reasoning Revisited , 2009, J. Log. Comput..

[23]  Hubie Chen,et al.  Arc consistency and friends , 2011, J. Log. Comput..

[24]  Hubie Chen.  The expressive rate of constraints , 2005, Annals of Mathematics and Artificial Intelligence.

[25]  Hubie Chen,et al.  (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability , 2004, CP.

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

[27]  Heribert Vollmer,et al.  Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar] , 2008, Complexity of Constraints.

[28]  Clément Carbonnel.  The Meta-Problem for Conservative Mal'tsev Constraints , 2016, AAAI.

[29]  Manuel Bodirsky,et al.  Oligomorphic clones , 2007 .

[30]  Hubie Chen,et al.  Constraint satisfaction with succinctly specified relations , 2010, J. Comput. Syst. Sci..

[31]  S. Swierczkowski.  Algebras which are independently generated by every n elements , 1960 .

[32]  M. Siggers.  A strong Mal’cev condition for locally finite varieties omitting the unary type , 2010 .

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

[34]  Libor Barto,et al.  Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

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

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

[37]  David A. Cohen,et al.  Domain permutation reduction for constraint satisfaction problems , 2008, Artif. Intell..

[38]  Andrei A. Bulatov,et al.  Dualities for Constraint Satisfaction Problems , 2008, Complexity of Constraints.

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

[40]  Manuel Bodirsky,et al.  Peek arc consistency , 2010, Theor. Comput. Sci..

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

[42]  Jaroslav Opatrny,et al.  Total Ordering Problem , 1979, SIAM J. Comput..

[43]  Dániel Marx.  Tractable Structures for Constraint Satisfaction with Truth Tables , 2009, Theory of Computing Systems.

[44]  Andrei A. Krokhin,et al.  On algebras with many symmetric operations , 2016, Int. J. Algebra Comput..

[45]  Pascal Tesson,et al.  Universal algebra and hardness results for constraint satisfaction problems , 2007, Theor. Comput. Sci..

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

[47]  Ryan O'Donnell,et al.  Linear programming, width-1 CSPs, and robust satisfaction , 2012, ITCS '12.

[48]  R. McKenzie,et al.  Varieties with few subalgebras of powers , 2009 .