Manuel Bodirsky
Abstract
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in polynomial time, or is NP-complete.
We present an analog of this dichotomy result for the propositional logic of graphs instead of Boolean logic. In this generalization of Schaefer's result, the input consists of a set W of variables and a conjunction Φ of statements (“constraints”) about these variables in the language of graphs, where each statement is taken from a fixed finite set Ψ of allowed quantifier-free first-order formulas; the question is whether Φ is satisfiable in a graph.
We prove that either Ψ is contained in one out of 17 classes of graph formulas and the corresponding problem can be solved in polynomial time, or the problem is NP-complete. This is achieved by a universal-algebraic approach, which in turn allows us to use structural Ramsey theory. To apply the universal-algebraic approach, we formulate the computational problems under consideration as constraint satisfaction problems (CSPs) whose templates are first-order definable in the countably infinite random graph. Our method for classifying the computational complexity of those CSPs is based on a Ramsey-theoretic analysis of functions acting on the random graph, and we develop general tools suitable for such an analysis which are of independent mathematical interest.
- F. G. Abramson and L. Harrington. 1978. Models without indiscernibles. J. Symb. Logic 43, 3, 572--600.Google Scholar
Cross Ref
- M. Bodirsky. 2012. Complexity classification in infinite-domain constraint satisfaction. Mémoire d'habilitation à diriger des recherches, Université Diderot -- Paris 7. arXiv:1201.0856.Google Scholar
- M. Bodirsky, H. Chen, J. Kára, and T. von Oertzen. 2009. Maximal infinite-valued constraint languages. Theoret. Comput. Sci. (TCS) 410, 1684--1693. (A preliminary version appeared in Proceedings of ICALP'07.) Google ScholarDigital Library
- M. Bodirsky, H. Chen, and M. Pinsker. 2010. The reducts of equality up to primitive positive interdefinability. J. Symb. Logic 75, 4, 1249--1292.Google ScholarCross Ref
- M. Bodirsky, P. Jonsson, and T. von Oertzen. 2011. Horn versus full first-order: A complexity dichotomy for algebraic constraint satisfaction problems. J. Logic Comput. 22, 3, 643--660. Google ScholarDigital Library
- M. Bodirsky and J. Kára. 2008. The complexity of equality constraint languages. Theory of Comput. Syst. 3, 2, 136--158. (A conference version appeared in Proceedings of Computer Science Russia (CSR'06).) Google ScholarCross Ref
- M. Bodirsky and J. Kára. 2009. The complexity of temporal constraint satisfaction problems. J. ACM 57, 2, 1--41. (An extended abstract appeared in the Proceedings of the Symposium on Theory of Computing (STOC'08).) Google ScholarDigital Library
- M. Bodirsky and J. Kára. 2010. A fast algorithm and Datalog inexpressibility for temporal reasoning. ACM Trans. Computat. Logic 11, 3. Google ScholarDigital Library
- M. Bodirsky and J. Nešetřril. 2006. Constraint satisfaction with countable homogeneous templates. J. Logic Computat. 16, 3, 359--373. Google ScholarDigital Library
- M. Bodirsky and M. Pinsker. 2011a. Reducts of Ramsey structures. AMS Contemp. Math. 558 (Model Theoretic Methods in Finite Combinatorics), 489--519.Google Scholar
- M. Bodirsky and M. Pinsker. 2011b. Schaefer's theorem for graphs. In Proceedings of the Annual Symposium on Theory of Computing (STOC). 655--664. Google ScholarDigital Library
- M. Bodirsky and M. Pinsker. 2014. Minimal functions on the random graph. Isr. J. Math. 200, 1, 251--296.Google ScholarCross Ref
- M. Bodirsky and M. Pinsker. 2015. Topological Birkhoff. Trans. Amer. Math. Soc. 367, 2527--2549.Google ScholarCross Ref
- M. Bodirsky, M. Pinsker, and A. Pongrácz. 2013a. The 42 reducts of the random ordered graph. Proc. LMS. To appear. (Preprint arXiv:1309.2165.)Google Scholar
- M. Bodirsky, M. Pinsker, and T. Tsankov. 2013b. Decidability of definability. J. Symb. Logic 78, 4, 1036--1054. (A conference version appeared in Proceedings of LICS 2011, pages 321--328.) Google ScholarDigital Library
- A. A. Bulatov, A. A. Krokhin, and P. G. Jeavons. 2005. Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34, 720--742. Google ScholarDigital Library
- P. J. Cameron. 1997. The random graph. Algor. Combinat. 14, 333--351.Google ScholarCross Ref
- P. J. Cameron. 2001. The random graph revisited. In Proceedings of the European Congress of Mathematics, vol. 201, Birkhäuser, 267--274.Google ScholarCross Ref
- H. Chen. 2006. A rendezvous of logic, complexity, and algebra. SIGACT News 37, 4, 85--114. Google ScholarDigital Library
- D. A. Cohen, P. Jeavons, P. Jonsson, and M. Koubarakis. 2000. Building tractable disjunctive constraints. J. ACM 47, 5, 826--853. Google ScholarDigital Library
- I. Duentsch. 2005. Relation algebras and their application in temporal and spatial reasoning. Artifi. Intell. Rev. 23, 315--357. Google ScholarDigital Library
- G. Exoo. 1989. A lower bound for R(5,5). J. Graph Theory 13, 97--98.Google ScholarCross Ref
- M. Garey and D. Johnson. 1978. A Guide to NP-Completeness. CSLI Press, Stanford.Google Scholar
- M. Goldstern and M. Pinsker. 2008. A survey of clones on infinite sets. Algebra Univ. 59, 365--403.Google ScholarCross Ref
- W. Hodges. 1997. A Shorter Model Theory. Cambridge University Press, Cambridge. Google ScholarDigital Library
- P. Jeavons, D. Cohen, and M. Gyssens. 1997. Closure properties of constraints. J. ACM 44, 4, 527--548. Google ScholarDigital Library
- J. Nešetřril. 1995. Ramsey theory. Handbook of Combinatorics, 1331--1403. Google ScholarDigital Library
- J. Nešetřril and V. Rödl. 1983. Ramsey classes of set systems. J. Combinat. Theory, Series A 34, 2, 183--201.Google ScholarCross Ref
- T. J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the Symposium on Theory of Computing (STOC). 216--226. Google ScholarDigital Library
- Á. Szendrei. 1986. Clones in Universal Algebra. Séminaire de Mathématiques Supérieures. Les Presses de l'Université de Montréal.Google Scholar
- S. Thomas. 1991. Reducts of the random graph. J. Symb. Logic 56, 1, 176--181. Google ScholarDigital Library
- S. Thomas. 1996. Reducts of random hypergraphs. Ann. Pure Appl. Logic 80, 2, 165--193.Google ScholarCross Ref
- M. Westphal and S. Wölfl. 2009. Qualitative CSP, finite CSP, and SAT: Comparing methods for qualitative constraint-based reasoning. In Proceedings of the 21th International Joint Conference on Artificial Intelligence (IJCAI). 628--633. Google ScholarDigital Library
Index Terms
- Schaefer's Theorem for Graphs
Recommendations
Schaefer's theorem for graphs
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computingSchaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in polynomial ...
Decidability of Definability
LICS '11: Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer ScienceFor a fixed infinite structure $\Gamma$ with finite signature tau, we study the following computational problem: input are quantifier-free first-order tau-formulas phi_0,phi_1,...,phi_n that define relations R_0,R_1,\dots,R_n over Gamma. The question is ...
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
For $n\geq 3$, let $(H_n, E)$ denote the $n$th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all structures $\Gamma$ ...
Comments