Abstract
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universal-algebraic ideas. We give applications illustrating the use of our technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bodirsky, M.: Constraint satisfaction with infinite domains. Ph.D. thesis, Humboldt-Universität zu Berlin (2004)
Bodirsky, M.: The core of a countably categorical structure. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 100–110. Springer, Heidelberg (2005)
Bodirsky, M., Chen, H.: Quantified equality constraints (manuscript, 2006)
Bodirsky, M., Kára, J.: The complexity of equality constraint languages. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 114–126. Springer, Heidelberg (2006)
Boerner, F., Bulatov, A., Krokhin, A., Jeavons, P.: Quantified constraints: Algorithms and complexity. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 58–70. Springer, Heidelberg (2003)
Bulatov, A., Dalmau, V.: A simple algorithm for Mal’tsev constraints. SIAM J. Comp. (to appear)
Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: Proceedings of STOC 2001, pp. 667–674 (2001)
Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: FOCS 2002, pp. 649–658 (2002)
Chen, H.: The computational complexity of quantified constraint satisfaction. Ph.D. thesis, Cornell University (August 2004)
Chen, H.: Collapsibility and consistency in quantified constraint satisfaction. In: AAAI, pp. 155–160 (2004)
Chen, H.: Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 315–326. Springer, Heidelberg (2005)
Dalmau, V.: Generalized majority-minority operations are tractable. In: LICS, pp. 438–447 (2005)
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)
Gottlob, G., Greco, G., Scarcello, F.: The complexity of quantified constraint satisfaction problems under structural restrictions. In: IJCAI 2005 (2005)
Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)
Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. AI 101(1-2), 251–265 (1998)
Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Proceedings of PODS 1998, pp. 205–213 (1998)
Kozen, D.: Positive first-order logic is NP-complete. IBM Journal of Research and Development 25(4), 327–332 (1981)
Pan, G., Vardi, M.: Fixed-parameter hierarchies inside PSPACE. In: LICS 2006 (to appear, 2006)
Stockmeyer, L.J., Meye, A.R.: Word problems requiring exponential time: Preliminary report. In: STOC, pp. 1–9 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodirsky, M., Chen, H. (2006). Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. In: Ésik, Z. (eds) Computer Science Logic. CSL 2006. Lecture Notes in Computer Science, vol 4207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11874683_13
Download citation
DOI: https://doi.org/10.1007/11874683_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45458-8
Online ISBN: 978-3-540-45459-5
eBook Packages: Computer ScienceComputer Science (R0)