The complexity of quantified constraint satisfaction: Collapsibility, sink algebras, and the three-element case

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1674-1701

  Chen, Hubie ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Computational complexity; Constraint satisfaction; Quantified satisfiability; Universal algebra

Indexed keywords

ALGEBRA; BOOLEAN FUNCTIONS; COMPUTER OPERATING PROCEDURES; LINGUISTICS; QUERY LANGUAGES; STEELMAKING;

COMBINATORIAL SEARCHES; COMMON STRUCTURES; COMPLEXITY RESULTS; CONSTRAINT LANGUAGES; CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTIONS; DO-MAINS; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; QUANTIFIED SATISFIABILITY; UNIVERSAL ALGEBRA;

COMPUTATIONAL COMPLEXITY;

EID: 49049086750     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060668572     Document Type: Article

References (32)

1. B. ASPVALL, M. F. PLASS, AND R. E. TARJAN, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process, Lett., 8 (1979), pp. 121-123.
2. E. BÖHLER, N. CREIGNOU, S. REITH, AND H. VOLLMER, Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory, ACM SIGACT-Newsletter, 34 (4) (2003), pp. 38-52.
3. F. BÖRNER, A. BULATOV, A. KROKHIN, AND P. JEAVONS, Quantified constraints: Algorithms and, complexity, in Computer Science Logic, Lecture Notes in Comput. Sci. 2803, Springer-Verlag, Berlin, 2003, pp. 58-70.
4. A. BULATOV, Mal'tsev Constraints Are Tractable, Technical report PRG-RR-02-05, Oxford University, Oxford, UK, 2002.
5. A. BULATOV, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS '03), 2003, pp. 321-330.
6. A. BULATOV AND V. DALMAU, A simple algorithm for Mal'tsev constraints, SIAM J. Comput., 36 (2006), pp. 16-27.
7. A. BULATOV, P. JEAVONS, AND A. KROKHIN, Classifying the complexity of constraints using finite algebras, SIAM J. Comput., 34 (2005), pp. 720-742.
8. A. BULATOV, A. KROKHIN, AND P. JEAVONS, The complexity of maximal constraint languages, in Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, 2001, pp. 667-674.
9. A. A. BULATOV, A dichotomy theorem for constraint satisfaction problems on a 3-element set, J. ACM, 53 (2006), pp. 66-120.
10. H. CHEN, Quantified constraint satisfaction and, 2-semilattice polymorphisms, in Principles and Practice of Constraint Programming (CP 2004), Lecture Notes in Comput. Sci. 3258, Springer-Verlag, Berlin, 2004, pp. 168-181.
11. N. CREIGNOU, S. KHANNA, AND M. SUDAN, Complexity Classifications of Boolean Constraint-Satisfaction Problems, SIAM Monogr. Discrete Math. Appl. 7, SIAM, Philadelphia, 2001.
12. V. 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, Barcelona, 1997.
13. V. DALMAU, A new tractable class of constraint satisfaction problems, in Proceedings of the 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
14. V. DALMAU, Mal'tsev Constraints Made Simple, ECCC technical report. 2004.
15. V. DALMAU, Generalized majority-minority operations are tractable, Log. Methods Comput. Sci., 2 (2006), 14 pp.
16. H. D. EBBINGHAUS, J. FLUM, AND W. THOMAS, Mathematical Logic, Springer-Verlag, New York, 1984.
17. T. FEDER AND M. Y. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
18. P. HELL AND J. NESETRIL, Graphs and Homomorphisms, Oxford University Press, Oxford, UK, 2004.
19. P. HELL AND J. NEŠETŘIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
20. P. JEAVONS, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci., 200 (1998), pp. 185-204.
21. P. JEAVONS, D. COHEN, AND M. COOPER, Constraints, consistency, and closure, Artificial Intelligence, 101 (1998), pp. 251-265.
22. P. G. JEAVONS, D. A. COHEN, AND M. GYSSENS, Closure properties of constraints, J. ACM, 44 (1997), pp. 527-548.
23. M. KARPINSKI H. KLEINE BÜNING, AND P. H. SCHMITT, On the computational complexity of quantified Horn clauses, in Proceedings of the First Workshop on Computer Science Logic, Lecture Notes in Comput. Sci. 329, Springer-Verlag, Berlin, 1987, pp. 129-137.
24. E. KISS AND M. VALERIOTE, On tractability and congruence distributivity, Log. Methods Comput. Sci., 3 (2007), 20 pp.
25. H. KLEINE BÜNING, M. KARPINSKI AND A. FLÖGEL, Resolution for quantified Boolean formulas, Inform. Comput., 117 (1995), pp. 12-18.
26. PH. G. KOLAITIS AND M. Y. VARDI, Conjunctive-query containment and constraint satisfaction, J. Comput. System Sci., 61 (2000), pp. 302-332.
27. B. LAROSE AND L. ZÁDORI, Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras, Internat. J. Algebra Comput., 16 (2006), pp. 563-581.
28. B. MARTIN AND F. MADELAINE, Towards a trichotomy for quantified H-coloring, in Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, Lecture Notes in Comput. Sci. 3988, Springer-Verlag, Berlin, 2006, pp. 342-352.
29. R. N. MCKENZIE, G. F. MCNULTY, AND W. F. TAYLOR, Algebras, Lattices, and Varieties, Vol. I, Wadsworth and Brooks, Monterey, CA, 1987.
30. T. J. SCHAEFER, The complexity of satisfiability problems, in Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (STOC), 1978, pp. 216-226.
31. L. STOCKMEYER AND A. R. MEYER, Word problems requiring exponential time, in Proceedings of the 5th Annual ACM Symposium on Theory of Computing, 1973, pp. 1-10.
32. A. SZENDREI, Clones in Universal Algebra, Séminaire de Mathématiques Supérieures 99, University of Montreal Press, Montreal, 1986.