Abstract
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.
- E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer. 2009. The complexity of satisfiability problems: Refining Schaefer’s theorem.Journal of Computer and System Sciences 75, 4, 245--254. Google Scholar
Digital Library
- Libor Barto. 2014. The collapse of the bounded width hierarchy. Journal of Logic and Computation 26, 3, 923--943.Google Scholar
Cross Ref
- L. Barto and M. Kozik. 2009. Constraint satisfaction problems of bounded width. In Proceedings of Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS’09). Google Scholar
Digital Library
- Libor Barto and Marcin Kozik. 2014. Constraint satisfaction problems solvable by local consistency methods. Journal of the ACM 61, 1, 3. Google Scholar
Digital Library
- Libor Barto, Marcin Kozik, and David Stanovský. 2015. Mal’tsev conditions, lack of absorption, and solvability. Algebra Universalis 74, 1, 185--206.Google Scholar
Cross Ref
- Libor Barto, Jakub Oprsal, and Michael Pinsker. 2015. The wonderland of reflections. arXiv:1510.04521.Google Scholar
- J. Berman, P. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R. Willard. 2010. Varieties with few subalgebras of powers. Transactions of the American Mathematical Society 362, 3, 1445--1473.Google Scholar
Cross Ref
- Manuel Bodirsky and Hubie Chen. 2007. Oligomorphic clones. Algebra Universalis 57, 1, 109--125.Google Scholar
Cross Ref
- Manuel Bodirsky and Hubie Chen. 2009. Qualitative temporal and spatial reasoning revisited. Journal of Logic and Computation 19, 6, 1359--1383. Google Scholar
Digital Library
- Manuel Bodirsky and Hubie Chen. 2010. Peek arc consistency. Theoretical Computer Science 411, 2, 445--453. Google Scholar
Digital Library
- Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, and Andrei A. Krokhin. 2009. The complexity of constraint satisfaction games and QCSP. Information and Computation 207, 9, 923--944. Google Scholar
Digital Library
- Simone Bova, Hubie Chen, and Matthew Valeriote. 2013. Generic expression hardness results for primitive positive formula comparison. Information and Computation 222, 108--120. Google Scholar
Digital Library
- Andrei Bulatov and Victor Dalmau. 2006. A simple algorithm for Mal’tsev constraints. SIAM Journal of Computing 36, 1, 16--27. Google Scholar
Digital Library
- Andrei Bulatov and Peter Jeavons. 2000. Tractable Constraints Closed Under a Binary Operation. Technical Report PRG-TR-12-00. Oxford University Computing Laboratory. http://www.cs.ox.ac.uk/techreports/oucl/TR-12-00.ps.gz.Google Scholar
- A. Bulatov, P. Jeavons, and A. Krokhin. 2005. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 3, 720--742. Google Scholar
Digital Library
- Andrei A. Bulatov. 2011. Complexity of conservative constraint satisfaction problems. ACM Transactions on Computational Logic 12, 4, 24. Google Scholar
Digital Library
- Andrei A. Bulatov, Andrei A. Krokhin, and Benoit Larose. 2008. Dualities for constraint satisfaction problems. In Complexity of Constraints: An Overview of Current Research Themes {Result of a Dagstuhl Seminar}. 93--124. Google Scholar
Digital Library
- Andrei A. Bulatov and Matthew Valeriote. 2008. Recent results on the algebraic approach to the CSP. In Complexity of Constraints: An Overview of Current Research Themes {Result of a Dagstuhl Seminar}. 68--92. Google Scholar
Digital Library
- C. Carbonnel. 2016. The meta-problem for conservative Mal’tsev constraints. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI’16). Google Scholar
Digital Library
- Catarina Carvalho and Andrei Krokhin. 2016. On algebras with many symmetric operations. arXiv:1406.5061.Google Scholar
- Hubie Chen. 2005. The expressive rate of constraints. Annals of Mathematics and Artificial Intelligence 44, 4, 341--352. Google Scholar
Digital Library
- Hubie Chen. 2011. Quantified constraint satisfaction and the polynomially generated powers property. Algebra Universalis 65, 3, 213--241.Google Scholar
Cross Ref
- Hubie Chen. 2012. Meditations on quantified constraint satisfaction. In Logic and Program Semantics. Lecture Notes in Computer Science, Vol. 7230. 35--49. Google Scholar
Digital Library
- Hubie Chen and Victor Dalmau. 2004. (Smart) look-ahead arc consistency and the pursuit of CSP tractability. In Principles and Practice of Constraint Programming—CP 2004. Lecture Notes in Computer Science, Vol. 3258. Springer, 182--196. Google Scholar
Digital Library
- Hubie Chen, Víctor Dalmau, and Berit Grußien. 2013. Arc consistency and friends. Journal of Logic and Computation 23, 1, 87--108. Google Scholar
Digital Library
- Hubie Chen and Martin Grohe. 2010. Constraint satisfaction with succinctly specified relations. Journal of Computer and System Sciences 76, 8, 847--860. Google Scholar
Digital Library
- Víctor Dalmau and Andrei Krokhin. 2013. Robust satisfiability for CSPs: Hardness and algorithmic results. ACM Transactions on Computation Theory 5, 4, Article No. 15. 1942-3454 Google Scholar
Digital Library
- Vìctor Dalmau and Justin Pearson. 1999. Closure functions and width 1 problems. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP’99). 159--173. Google Scholar
Digital Library
- T. Feder. 2001. Classification of homomorphisms to oriented cycles and k-partite satisfiability. SIAM Journal on Discrete Mathematics 14, 471--480. Google Scholar
Digital Library
- T. Feder and M. Vardi. 1999. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57--104. Google Scholar
Digital Library
- Martin J. Green and David A. Cohen. 2008. Domain permutation reduction for constraint satisfaction problems. Artificial Intelligence 172, 8--9, 1094--1118. Google Scholar
Digital Library
- P. Idziak, P. Markovic, R. McKenzie, M. Valeriote, and R. Willard. 2010. Tractability and learnability arising from algebras with few subpowers. SIAM Journal on Computing 39, 7, 3023--3037. Google Scholar
Digital Library
- P. Jeavons, D. Cohen, and M. Cooper. 1998. Constraints, consistency, and closure. Artificial Intelligence 101, 1--2, 251--265. Google Scholar
Digital Library
- Alexandr Kazda. 2011. CSP for binary conservative relational structures. arXiv:1112.1099.Google Scholar
- Alexandr Kazda. 2011. Maltsev digraphs have a majority polymorphism. European Journal of Combinatorics 32, 3, 390--397. Google Scholar
Digital Library
- Keith Kearnes, Petar Marković, and Ralph McKenzie. 2014. Optimal strong Mal’cev conditions for omitting type 1 in locally finite varieties. Algebra Universalis 72, 1, 91--100.Google Scholar
Cross Ref
- Marcin Kozik, Andrei Krokhin, Matt Valeriote, and Ross Willard. 2015. Characterizations of several Maltsev conditions. Algebra Universalis 73, 3--4, 205--204.Google Scholar
Cross Ref
- Gábor Kun, Ryan O’Donnell, Suguru Tamaki, Yuichi Yoshida, and Yuan Zhou. 2012. Linear programming, width-1 CSPs, and robust satisfaction. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS’12). 484--495. Google Scholar
Digital Library
- Benoit Larose and Pascal Tesson. 2009. Universal algebra and hardness results for constraint satisfaction problems. Theoretical Computer Science 410, 18, 1629--1647. Google Scholar
Digital Library
- Dániel Marx. 2011. Tractable structures for constraint satisfaction with truth tables. Theory of Computing Systems 48, 444--464. Google Scholar
Digital Library
- Jaroslav Opatrny. 1979. Total ordering problem. SIAM Journal on Computing 8, 1, 111--114.Google Scholar
Cross Ref
- T. J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the 10th Annual Symposium on Theory of Computing (STOC’78). 216--226. Google Scholar
Digital Library
- Mark H. Siggers. 2010. A strong Mal’cev condition for locally finite varieties omitting the unary type. Algebra Universalis 64, 1, 15--20.Google Scholar
Cross Ref
- S. Świerczkowski. 1960/1961. Algebras which are independently generated by every n elements. Fundamenta Mathematicae 49, 93--104.Google Scholar
Cross Ref
- A. Szendrei. 1992. A survey on strictly simple algebras and minimal varieties. In Research and Exposition in Mathematics. Heldermann Verlag, Berlin, Germany. 209--239.Google Scholar
- M. Valeriote. 2009. A subalgebra intersection property for congruence distributive varieties. Canadian Journal of Mathematics 61, 2, 451--464.Google Scholar
Cross Ref
Index Terms
Asking the Metaquestions in Constraint Tractability
Recommendations
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Special Issue on SODA'15 and Regular PapersThe Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of classes of ...
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (that is, ...
Uniform weak tractability
We introduce a new notion of tractability which is called uniform weak tractability. A problem is uniformly weakly tractable if the information complexity n(@e,d) of its d-variate component to be solved to within @e is not exponential in any positive ...






Comments