Skip to main content
SpringerLink
Log in

Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms

  • Conference paper
Principles and Practice of Constraint Programming – CP 2004 (CP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3258))

Abstract

The quantified constraint satisfaction problem (QCSP) is a natural and useful generalization of the constraint satisfaction problem (CSP) in which both universal and existential quantification of variables is permitted. Because the CSP and QCSP are in general intractable, much effort has been directed towards identifying restricted cases of these problems that are tractable in polynomial time. In this paper, we investigate restricted cases of the QCSP having 2-semilattice polymorphisms. We prove a complete classification of 2-semilattice polymorphisms, demonstrating that each gives rise to a case of the QCSP that is either tractable in polynomial time, or coNP-hard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspvall, B., Plass, M.F., Tarjan, R.E.: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Inf. Process. Lett. 8(3), 121–123 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  2. Börner, 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)

    Chapter  Google Scholar 

  3. Bulatov, A.: Combinatorial problems raised from 2-semilattices. Manuscript

    Google Scholar 

  4. Bulatov, A.A.: A Dichotomy Theorem for Constraints on a Three-Element Set. In: FOCS 2002 (2002)

    Google Scholar 

  5. Bulatov, A.: Malt’sev constraints are tractable. Technical report PRG-RR-02-05, Oxford University (2002)

    Google Scholar 

  6. Bulatov, A.A.: Tractable conservative Constraint Satisfaction Problems. In: LICS 2003 (2003)

    Google Scholar 

  7. Bulatov, A.A., Krokhin, A.A., Jeavons, P.: The complexity of maximal constraint languages. In: STOC 2001 (2001)

    Google Scholar 

  8. Bulatov, A.A., Krokhin, A.A., Jeavons, P.: Constraint Satisfaction Problems and Finite Algebras. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 272. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Bulatov, A., Jeavons, P.: An Algebraic Approach to Multi-sorted Constraints. In: Proceedings of 9th International Conference on Principles and Practice of Constraint Programming (2003)

    Google Scholar 

  10. Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical report MATH-AL-4-2001, Technische Universitat Dresden (2001)

    Google Scholar 

  11. Bulatov, A., Jeavons, P.: Tractable constraints closed under a binary operation. Technical report PRG-TR-12-00, Oxford University (2000)

    Google Scholar 

  12. Büning, H.K., Karpinski, M., Flögel, A.: Resolution for Quantified Boolean Formulas. Information and Computation 117(1), 12–18 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  13. Chen, H.: Quantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Algorithms. Cornell technical report (2003)

    Google Scholar 

  14. Chen, H.: Collapsibility and Consistency in Quantified Constraint Satisfaction. In: AAAI 2004 (2004)

    Google Scholar 

  15. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications 7 (2001)

    Google Scholar 

  16. Dalmau, V.: Some Dichotomy Theorems on Constant-free Quantified Boolean Formulas. Technical report LSI-97-43-R, Llenguatges i Sistemes Informàtics - Universitat Politècnica de Catalunya (1997)

    Google Scholar 

  17. Dalmau, V., Pearson, J.: Set Functions and Width 1. In: Constraint Programming 1999 (1999)

    Google Scholar 

  18. Feder, T., Vardi, M.Y.: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM J. Comput. 28(1), 57–104 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  19. Jeavons, P.: On the Algebraic Structure of Combinatorial Problems. Theor. Comput. Sci. 200(1-2), 185–204 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Jeavons, P.G., Cohen, D.A., Cooper, M.: Constraints, Consistency and Closure. Artificial Intelligence 101(1-2), 251–265 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  21. Jeavons, P., Cohen, D.A., Gyssens, M.: Closure properties of constraints. J. ACM 44(4), 527–548 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kolaitis, P.G., Vardi, M.Y.: Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2), 302–332 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  23. Kolaitis, P.G., Vardi, M.Y.: A Game-Theoretic Approach to Constraint Satisfaction. In: AAAI 2000 (2000)

    Google Scholar 

  24. Rosenberg, I.G.: Minimal Clones I: the five types. Lectures in Universal Algebra (Proc. Conf. Szeged 1983), Colloq. Math. Soc. Janos Bolyai (1986)

    Google Scholar 

  25. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual Symposium on Theory of Computing, ACM (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, NY, 14853, USA

    Hubie Chen

Authors
  1. Hubie Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clayton School of IT, Monash University, Australia

    Mark Wallace

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, H. (2004). Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30201-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23241-4

  • Online ISBN: 978-3-540-30201-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation