Quantified constraints: algorithms and complexity

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

Volumn 2803, Issue , 2003, Pages 58-70

  Börner, Ferdinand ^a   Bulatov, Andrei ^b   Jeavons, Peter ^b   Krokhin, Andrei ^c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY;

ALGORITHMS AND COMPLEXITY; EXISTENTIAL QUANTIFIERS; FINITE DOMAINS; FIRST ORDER SENTENCES; OVER-CONSTRAINED; PARAMETERIZED PROBLEMS; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; STANDARD CONSTRAINTS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248889949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_6     Document Type: Article

References (38)

1. Aspvall, B., Plass, M., Tarjan, R.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (1979) 121-123
2. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence and isomorphism for Boolean constraint satisfaction. In: Proceedings 16th International Workshop on Computer Science Logic, CSL'02. Volume 2471 of Lecture Notes in Computer Science., Springer-Verlag (2002) 412-426
3. Börner, F., Krokhin, A., Bulatov, A., Jeavons, P.: Quantified constraints and surjective polymorphisms. Technical Report PRG-RR-02-11, Computing Laboratory, University of Oxford, UK (2002)
4. Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings of 43rd IEEE Symposium on Foundations of Computer Science, FOCS'02. (2002) 649-658
5. Bulatov, A.: Mal'tsev constraints are tractable. Technical Report RR-02-05, Computing Laboratory, Oxford University (2002)
6. Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings 18th IEEE Symposium on Logic in Computer Science, LICS'03. (2003) to appear.
7. Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische Universität Dresden, Germany (2001)
8. Bulatov, A., Krokhin, A., Jeavons, P.: 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., Springer-Verlag (2000) 272-282
9. Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: Proceedings 33rd ACM Symposium on Theory of Computing, STOC'01. (2001) 667-674
10. Cooper, M., Cohen, D., Jeavons, P.: Characterising tractable constraints. Artificial Intelligence 65 (1994) 347-361
11. Creignou, N., Daudé, H.: Random generalized satisfiability problems. In: Proceedings of 5th International Symposium on Theory and Applications of Satisfiability Testing - SAT'02. (2002) 17-26
12. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. Volume 7 of SIAM Monographs on Discrete Mathematics and Applications. (2001)
13. Crescenzi, P., Rossi, G.: On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science 288 (2002) 85-100
14. Dalmau, V.: Some dichotomy theorems on constant-free quantified Boolean formulas. Technical Report TR LSI-97-43-R, Department LSI, Universitat Politecnica de Catalunya (1997)
15. Dalmau, V.: A new tractable class of constraint satisfaction problems. In: Proceedings 6th International Symposium on Artificial Intelligence and Mathematics. (2000)
16. Dalmau, V.: Constraint satisfaction problems in non-deterministic logarithmic space. In: Proceedings 29th International Colloquium on Automata, Languages and Programming, ICALP'02. Volume 2380 of Lecture Notes in Computer Science., Springer-Verlag (2002) 414-425
17. 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 (1998) 57-104
18. Freuder, E.: Exploiting structure in constraint satisfaction problems. In Mayoh, M., Tyugum, E., Penjam, J., eds.: Constraint Programming. Volume 131 of NATO ASI Series., Springer-Verlag (1993)
19. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA. (1979)
20. Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
21. Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
22. Juban, L.: Dichotomy theorem for generalized unique satisfiability problem. In: Proceedings 12th Conference on Fundamentals of Computation Theory, FCT'99. Volume 1684 of Lecture Notes in Computer Science., Springer-Verlag (1999) 327-337
23. Kawadias, D., Sireni, M.: The inverse satisfiability problem. SIAM Journal on Computing 28 (1998) 152-163
24. Kirousis, L.: Fast parallel constraint satisfaction. Artificial Intelligence 64 (1993) 147-160
25. Kirousis, L., Kolaitis, P.: The complexity of minimal satisfiability problems. In: Proceedings 18th International Symposium on Theoretical Aspects of Computer Science, STACS'01. Volume 2010 of Lecture Notes in Computer Science., Springer-Verlag (2001) 407-418
26. Kleine Büning, H., Karpinski, M., Flögel, A.: Resolution for quantified Boolean formulas. Information and Computation 117 (1995) 12-18
27. Kolaitis, P., Vardi, M.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61 (2000) 302-332
28. Marriott, K., Stuckey, P.: Programming with Constraints: an Introduction. MIT Press (1998)
29. Papadimitriou, C.: Computational Complexity. Addison-Wesley (1994)
30. Pippenger, N.: Theories of Computability. Cambridge University Press, Cambridge (1997)
31. Pöschel, R.: Galois connections for operations and relations. Technical Report MATH-AL-8-2001, Technische Universität Dresden, Germany (2001)
32. Pöschel, R., Kalužnin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)
33. Post, E.: The two-valued iterative systems of mathematical logic. Volume 5 of Annals Mathematical Studies. Princeton University Press (1941)
34. Reith, S., Vollmer, H.: Optimal satisfiability for prepositional calculi and constraint satisfaction problems. In: Proceedings 25th International Symposium on Mathematical Foundations of Computer Science, MFCS'00. Volume 1893 of Lecture Notes in Computer Science., Springer (2000) 640-649
35. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings 10th ACM Symposium on Theory of Computing, STOC'78. (1978) 216-226
36. Szendrei, A.: Clones in Universal Algebra. Volume 99 of Seminaires de Mathematiques Superieures. University of Montreal (1986)
37. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
38. Williams, R.: Algorithms for quantified Boolean formulas. In: Proceedings ACM Symposium on Discrete Algorithms, SODA'02. (2002) 299-307