Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 315-326

  Chen, Hubie ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LANGUAGES; PROBLEM SOLVING;

CONSTRAINT LANGUAGES; CONSTRAINT SATISFACTION PROBLEM (CSP); POLYMORPHISMS; QUANTIFIED CONSTRAINT SATISFACTION PROBLEM (QCSP);

CONSTRAINT THEORY;

EID: 24144483411     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_26     Document Type: Conference Paper

References (30)

1. Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8(3):121-123, 1979.
2. E. Böhler, N. Creignou, S. Reith, and H. Vollmer. Playing with boolean blocks, part II: constraint satisfaction problems. ACM SIGACT-Newsletter, 35(1):22-35, 2004.
3. F. Börner, A. Bulatov, A. Krokhin, and P. Jeavons. Quantified constraints: Algorithms and complexity. In Computer Science Logic 2003, 2003.
4. Andrei Bulatov. Combinatorial problems raised from 2-semilattices. Manuscript.
5. Andrei Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of 43rd IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.
6. Andrei Bulatov. Malt'sev constraints are tractable. Technical Report PRG-RR-02-05, Oxford University, 2002.
7. Andrei Bulatov. Tractable conservative constraint satisfaction problems. In Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS '03), pages 321-330, 2003.
8. Andrei Bulatov. A graph of a relational structure and constraint satisfaction problems. In Proceedings of 19th IEEE Annual Symposium on Logic in Computer Science (LICS'04), 2004.
9. Andrei Bulatov and Peter Jeavons. Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00, Oxford University, 2000.
10. Andrei Bulatov, Andrei Krokhin, and Peter Jeavons. Constraint satisfaction problems and finite algebras. In Proceedings 27th International Colloquium on Automata, Languages, and Programming - ICALP'00, volume 1853 of Lecture Notes In Computer Science, pages 272-282, 2000.
11. Andrei Bulatov, Andrei Krokhin, and Peter Jeavons. The complexity of maximal constraint languages. In ACM Symposium on Theory of Computing, pages 667-674, 2001.
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. Collapsibility and consistency in quantified constraint satisfaction. In AAAI, 2004.
14. Hubie Chen. Quantified constraint satisfaction and 2-semilattice polymorphisms. In CP, 2004.
15. Nadia Creignou, Sanjeev Khanna, and Madhu Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 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. A new tractable class of constraint satisfaction problems. In 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
18. Victor Dalmau and Justin Pearson. Closure functions and width 1 problems. In CP 1999, pages 159-173, 1999.
19. Tomas 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.
20. Peter Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
21. Peter Jeavons, David Cohen, and Martin Cooper. Constraints, consistency, and closure. Articial Intelligence, 101(1-2):251-265, 1998.
22. Peter Jeavons, David Cohen, and Justin Pearson. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence, 24(1-4):51-67, 1998.
23. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
24. D. Kavvadias and M. Sideri. The inverse satisfiability problem. SIAM Journal on Computing, 28(1):152-163, 1998.
25. Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863-1920, 2001.
26. L. M. Kirousis and P. G. Kolaitis. The complexity of minimal satisfiability problems. In Proceedings 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of Lecture Notes in Computer Science, pages 407-418. Springer-Verlag, 2001.
27. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61:302-332, 2000.
28. Emil L. Post. The Two-Valued Iterative Systems of Mathematical Logic. Princeton University Press, 1941.
29. I.G. Rosenberg. Minimal clones I: the five types. In Lectures in Universal Algebra (Proc. Conf. Szeged 1983), volume 43 of Colloq. Math. Soc. Janos Bolyai, pages 405-427. North-Holland, 1986.
30. Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 216-226, 1978.