Abstract
We show that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ω-categorical template Γ such that L reduces to CSP(Γ) and CSP(Γ) is in coNPL (i.e., the class coNP with an oracle for L). CSPs with ω-categorical templates are of special interest, because the universal-algebraic approach can be applied to study their computational complexity.
Furthermore, we prove that there are ω-categorical templates with coNP-complete CSPs and ω-categorical templates with coNP- intermediate CSPs, i.e., problems in coNP that are neither coNP- complete nor in P (unless P=coNP). To construct the coNP-intermediate CSP with ω-categorical template we modify the proof of Ladner’s theorem. A similar modification allows us to also prove a non-dichotomy result for a class of left-hand side restricted CSPs, which was left open in [10]. We finally show that if the so-called local-global conjecture for infinite constraint languages (over a finite domain) is false, then there is no dichotomy for the constraint satisfaction problem for infinite constraint languages.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Turing Machine
- Constraint Satisfaction
- Constraint Satisfaction Problem
- Relation Symbol
- Amalgamation Property
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bauslaugh, B.L.: The complexity of infinite h-coloring. J. Comb. Theory, Ser. B 61(2), 141–154 (1994)
Bodirsky, M.: Constraint satisfaction problems with infinite templates. Survey (to appear, 2007)
Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of LICS 2003, pp. 321–330 (2003)
Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. In: Proceedings of LICS 2004, Turku, Finland (2004)
Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical report MATH-AL-4-2001, Technische Universitat Dresden, submitted to International Journal of Algebra and Computing (2001)
Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Chen, Y., Thurley, M., Weyer, M.: Understanding the complexity of induced substructure isomorphisms. In: Aceto, L., Damgaard, I., Goldberg, L.A., Halldorsson, M.M., Ingolfsdottir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125. Springer, Heidelberg (2008)
Cherlin, G.: The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments. AMS Memoir. 131(621) (January 1998)
Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57–104 (1999)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54(1) (2007)
Henson, C.W.: Countable homogeneous relational systems and categorical theories. Journal of Symbolic Logic 37, 494–500 (1972)
Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)
Idziak, P.M., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. In: LICS 2007, pp. 213–224 (2007)
Ladner, R.E.: On the structure of polynomial time reducibility. J. ACM 22(1), 155–171 (1975)
Nebel, B., Bürckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. J. ACM 42(1), 43–66 (1995)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Schwandtner, G.: Datalog on infinite structures. Dissertation, Humboldt-Universität zu Berlin (submitted, 2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodirsky, M., Grohe, M. (2008). Non-dichotomies in Constraint Satisfaction Complexity. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70583-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-70583-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70582-6
Online ISBN: 978-3-540-70583-3
eBook Packages: Computer ScienceComputer Science (R0)