Abstract
The quantified constraint satisfaction problem (QCSP) is the problem of deciding, given a structure and a first-order prenex sentence whose quantifier-free part is the conjunction of atoms, whether or not the sentence holds on the structure. One obtains a family of problems by defining, for each structure B, the problem QCSP(B) to be the QCSP where the structure is fixed to be B. In this article, we offer a viewpoint on the research program of understanding the complexity of the problems QCSP(B) on finite structures. In particular, we propose and discuss a group of conjectures; throughout, we attempt to place the conjectures in relation to existing results and to emphasize open issues and potential research directions.
Keywords
- Bipartite Graph
- Constraint Satisfaction
- Constraint Satisfaction Problem
- SIAM Journal
- Relation Symbol
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.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of FOCS 2009 (2009)
Berman, J., Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Varieties with few subalgebras of powers. Transactions of the American Mathematical Society 362(3), 1445–1473 (2010)
Bodirsky, M., Chen, H.: Quantified equality constraints. SIAM Journal on Computing 39(8), 3682–3699 (2010)
Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems. Journal of the ACM 57(2) (2010)
Bodirsky, M., Nešetřil, J.: Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation 16(3), 359–373 (2006)
Börner, F., Bulatov, A.A., Chen, H., Jeavons, P., Krokhin, A.A.: The complexity of constraint satisfaction games and QCSP. Information and Computation 207(9), 923–944 (2009)
Bova, S., Chen, H., Valeriote, M.: Generic Expression Hardness Results for Primitive Positive Formula Comparison. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 344–355. Springer, Heidelberg (2011)
Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on Computing 34(3), 720–742 (2005)
Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM (JACM) 53 (2006)
Bulatov, A.A.: The Complexity of the Counting Constraint Satisfaction Problem. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 646–661. Springer, Heidelberg (2008)
Chen, H.: Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 168–181. Springer, Heidelberg (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)
Chen, H.: Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. In: Electronic Colloquium on Computational Complexity, ECCC (2005)
Chen, H.: The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. SIAM Journal on Computing 37(5), 1674–1701 (2008)
Chen, H.: Existentially restricted quantified constraint satisfaction. Information and Computation 207(3), 369–388 (2009)
Chen, H.: A rendezvous of logic, complexity, and algebra. ACM Computing Surveys 42(1) (2009)
Chen, H.: Quantified constraint satisfaction and the polynomially generated powers property. Algebra Universalis 65, 213–241 (2011)
Cohen, D.A., Creed, P., Jeavons, P.G., Živný, S.: An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 231–242. Springer, Heidelberg (2011)
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)
Hyde, J.T., Louglin, N.J., Quick, M., Ruškuc, N., Wallis, A.R.: On the growth of generating sets for direct powers of semigroups. Semigroup Forum
Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. SIAM J. Comput. 39(7), 3023–3037 (2010)
Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency, and closure. Artificial Intelligence 101(1-2), 251–265 (1998)
Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185–204 (1998)
Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure Properties of Constraints. Journal of the ACM 44, 527–548 (1997)
Jonsson, P., Kuivinen, F., Nordh, G.: Max Ones generalized to larger domains. SIAM Journal on Computing 38, 329–365 (2008)
Larose, B., Zádori, L.: Bounded width problems and algebras. Algebra Universalis 56(3-4), 439–466 (2007)
Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. Theoretical Computer Science 410(18), 1629–1647 (2009)
Martin, B., Madelaine, F.: Towards a Trichotomy for Quantified H-Coloring. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 342–352. Springer, Heidelberg (2006)
Meier, D., Wiegold, J.: Growth sequences of finite groups V. Journal of the Australian Mathematical Society (Series A) 31, 374–375 (1981)
Quick, M., Ruškuc, N.: Growth of generating sets for direct powers of classical algebraic structures. Journal of the Australian Mathematical Society 89, 105–126 (2010)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216–226 (1978)
Wiegold, J.: Growth sequences of finite groups. Journal of the Australian Mathematical Society (Series A) 17, 133–141 (1974)
Wiegold, J.: Growth sequences of finite groups II. Journal of the Australian Mathematical Society (Series A) 20(2), 225–229 (1975)
Wiegold, J.: Growth sequences of finite groups III. Journal of the Australian Mathematical Society (Series A) 25(2), 142–144 (1978)
Wiegold, J.: Growth sequences of finite groups IV. Journal of the Australian Mathematical Society (Series A) 29, 14–16 (1980)
Wiegold, J.: Growth sequences of finite semigroups. Journal of the Australian Mathematical Society (Series A) 43, 16–20 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chen, H. (2012). Meditations on Quantified Constraint Satisfaction. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-29485-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29484-6
Online ISBN: 978-3-642-29485-3
eBook Packages: Computer ScienceComputer Science (R0)
