Quantified constraint satisfaction and 2-semilattice polymorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 168-181

  Chen, Hubie ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

COMPLETE CLASSIFICATION; EXISTENTIAL QUANTIFICATIONS; POLYNOMIAL-TIME; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; QUANTIFIED CONSTRAINT SATISFACTIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048873286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_15     Document Type: Article

References (25)

1. Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Inf. Process. Lett. 8(3): 121-123 (1979).
2. F. Börner, A. Bulatov, A. Krokhin, and P. Jeavons. Quantified Constraints: Algorithms and Complexity. Computer Science Logic 2003.
3. A. Bulatov. Combinatorial problems raised from 2-semilattices. Manuscript.
4. Andrei A. Bulatov. A Dichotomy Theorem for Constraints on a Three-Element Set. FOCS 2002.
5. A. Bulatov. Malt'sev constraints are tractable. Technical report PRG-RR-02-05, Oxford University, 2002.
6. Andrei A. Bulatov. Tractable conservative Constraint Satisfaction Problems. LICS 2003.
7. Andrei A. Bulatov and Andrei A. Krokhin and Peter Jeavons. The complexity of maximal constraint languages. STOC 2001.
8. Andrei A. Bulatov, Andrei A. Krokhin, and Peter Jeavons. Constraint Satisfaction Problems and Finite Algebras. ICALP 2000.
9. A. Bulatov and P. Jeavons. An Algebraic Approach to Multi-sorted Constraints Proceedings of 9th International Conference on Principles and Practice of Constraint Programming, 2003.
10. A. Bulatov, and P. Jeavons. Algebraic structures in combinatorial problems. Technical report MATH-AL-4-2001, Technische Universitat Dresden, 2001.
11. A. Bulatov, and P. Jeavons. Tractable constraints closed under a binary operation. Technical report PRG-TR-12-00, Oxford University, 2000.
12. Hans Kleine Büning, Marek Karpinski, and Andreas Flögel. Resolution for Quantified Boolean Formulas. Information and Computation 117(1): 12-18 (1995).
13. Hubie Chen. Quantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Algorithms. Cornell technical report, 2003.
14. Hubie Chen. Collapsibility and Consistency in Quantified Constraint Satisfaction. AAAI 2004.
15. Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications 7, 2001.
16. Victor Dalmau. 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.
17. Victor Dalmau and Justin Pearson. Set Functions and Width 1. Constraint Programming '99.
18. Tomás Feder and Moshe Y. Vardi. 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.
19. Peter Jeavons. On the Algebraic Structure of Combinatorial Problems. Theor. Comput. Sci. 200(1-2): 185-204, 1998.
20. P.G. Jeavons, D.A. Cohen and M. Cooper. Constraints, Consistency and Closure. Artificial Intelligence, 1998, 101(1-2), pages 251-265.
21. Peter Jeavons, David A. Cohen, and Marc Gyssens. Closure properties of constraints. J. ACM 44(4): 527-548 (1997).
22. Phokion G. Kolaitis, Moshe Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2): 302-332 (2000)
23. Phokion G. Kolaitis and Moshe Y. Vardi. A Game-Theoretic Approach to Constraint Satisfaction. AAAI 2000.
24. I.G. Rosenberg. Minimal Clones I: the five types. Lectures in Universal Algebra (Proc. Conf. Szeged 1983), Colloq. Math. Soc. Janos Bolyai. 1986.
25. T. Schaefer. The complexity of satisfiability problems. Proceedings of the 10th Annual Symposium on Theory of Computing, ACM, 1978.