The complexity of constraint satisfaction games and QCSP

Information and Computation

Volumn 207, Issue 9, 2009, Pages 923-944

  Borner F ^a   Bulatov, A ^b   Chen, H ^c   Jeavons, P ^d   Krokhin, A ^e  

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITAT POMPEU FABRA   (Spain)

^d UNIVERSITY OF OXFORD   (United Kingdom)

^e DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Algorithms; Complexity; Constraint satisfaction; Games; Polymorphisms; Quantified constraint satisfaction problem

Indexed keywords

COMPLEXITY; CONSTRAINT SATISFACTION; FINITE DOMAINS; FIRST-ORDER; GAMES; LOGICAL FORMS; LOWER COMPLEXITY; PARAMETER SET; QUANTIFIED CONSTRAINT SATISFACTION PROBLEM; SURJECTIVE; WINNING STRATEGY;

POLYMORPHISM; STEELMAKING;

GAME THEORY;

EID: 67949104867     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2009.05.003     Document Type: Article

References (53)

1. Aspvall B., Plass M.F., and Tarjan R.E. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (1979) 121-123
2. Bodlaender H.L. On the complexity of some coloring games. International Journal of Foundations of Computer Science 2 2 (1991) 133-147
3. L. Bordeaux, E. Monfroy, Beyond NP: Arc-consistency for quantified constraints, in: Proceedings of CP'02, LNCS, vol. 2470, 2002, pp. 371-386.
4. F. Börner, A. Bulatov, P. Jeavons, A. Krokhin, Quantified constraints: algorithms and complexity, in: Proceedings of CSL'03, LNCS, vol. 2803, 2003, pp. 58-70.
5. F. Börner, A. Krokhin, A. Bulatov, P. Jeavons, Quantified Constraints and Surjective Polymorphisms, Technical Report PRG-RR-02-11, Computing Laboratory, University of Oxford, UK, 2002.
6. Bulatov A. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53 1 (2006) 66-120
7. A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proceedings of LICS'03, 2003, pp. 321-330.
8. A. Bulatov, A graph of a relational structure and constraint satisfaction problems, in: Proceedings of LICS'04, 2004, pp. 448-457.
9. Bulatov A. Combinatorial problems raised from 2-semilattices. Journal of Algebra 298 2 (2006) 321-339
10. Bulatov A., and Dalmau V. A simple algorithm for Mal'tsev constraints. SIAM Journal on Computing 36 1 (2006) 16-27
11. A. Bulatov, P. Jeavons, An algebraic approach to multi-sorted constraints, in: Proceedings of CP'03, LNCS, vol. 2833, 2003, pp. 183-198.
12. Bulatov A., Jeavons P., and Krokhin A. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 3 (2005) 720-742
13. Cadoli M., Schaerf M., Giovanardi A., and Giovanardi M. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Journal of Automated Reasoning 28 2 (2002) 101-142
14. H. Chen, Collapsibility and consistency in quantified constraint satisfaction, in: Proceedings of AAAI'04, 2004, pp. 155-160.
15. H. Chen, The Computational Complexity of Quantified Constraint Satisfaction, Ph.D. thesis, Cornell University, 2004.
16. H. Chen, Quantified constraint satisfaction and 2-semilattice polymorphisms, in: Proceedings of CP'04, LNCS, vol. 3258, 2004, pp. 168-181.
17. H. Chen, Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms, in: Proceedings of STACS'05, LNCS, vol. 3404, 2005, pp. 315-326.
18. Chen H. The complexity of quantified constraint satisfaction: collapsibility, sink algebras, and the three-element case. SIAM Journal on Computing 37 5 (2008) 1674-1701
19. N. Creignou, S. Khanna, M. Sudan, Complexity classifications of boolean constraint satisfaction problems, SIAM Monographs on Discrete Mathematics and Applications, vol. 7, 2001.
20. V. Dalmau, Some dichotomy theorems on constant-free quantified Boolean formulas, Technical Report TR LSI-97-43-R, Department LSI, Universitat Politecnica de Catalunya, 1997.
21. V. Dalmau, Constraint satisfaction problems in non-deterministic logarithmic space, in: Proceedings of ICALP'02, LNCS, vol. 2380, 2002, pp. 414-425.
22. V. Dalmau, Generalized majority-minority operations are tractable, in: Proceedings of LICS'05, 2005, pp. 438-447.
23. Dalmau V. A new tractable class of constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence 44 1-2 (2005) 61-85
24. Dechter R. Constraint Processing (2003), Morgan Kaufman
25. U. Egly, T. Eiter, H. Tompits, S. Woltran, Solving advanced reasoning tasks using quantified Boolean formulas, in: Proceedings of AAAI'00, 2000, pp. 417-422.
26. T. Feder, Ph.G. Kolaitis, Closures and Dichotomies for Quantified Constraints, Electronic Colloquium on Computational Complexity, Report TR06-160, 2006.
27. Feder T., and Vardi M.Y. 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
28. A.S. Fraenkel, Combinatorial games, Electronic Journal of Combinatorics, 2003 (Dynamic Survey DS2).
29. Fraenkel A.S. Complexity, appeal and challenges of combinatorial games. Theoretical Computer Science 313 3 (2004) 393-415
30. Garey M., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
31. I.A. Gent, P. Nightingale, K. Stergiou, QCSP-solve: a solver for quantified constraint satisfaction problems, in: Proceedings of IJCAI'05, 2005, pp. 138-143.
32. Giunchiglia E., Narizzano M., and Tacchella A. Backjumping for quantified Boolean logic satisfiability. Artificial Intelligence 145 1-2 (2003) 99-120
33. Horn A. On sentences which are true of direct unions of algebras. Journal of Symbolic Logic 16 1 (1951) 14-21
34. Jeavons P. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
35. Jeavons P.G., Cohen D.A., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
36. Jeavons P.G., Cohen D.A., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
37. Kleine Büning H., Karpinski M., and Flögel A. Resolution for quantified Boolean formulas. Information and Computation 117 1 (1995) 12-18
38. Kolaitis Ph.G., and Vardi M.Y. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61 (2000) 302-332
39. Ph.G. Kolaitis, M.Y. Vardi, A game-theoretic approach to constraint satisfaction, in: Proceedings of AAAI'00, 2000, pp. 175-181.
40. Krokhin A., Bulatov A., and Jeavons P. The complexity of constraint satisfaction: an algebraic approach. Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Science Series II: Math., Phys., Chem vol. 207 (2005), Springer-Verlag 181-213
41. N. Mamoulis, K. Stergiou, Algorithms for quantified constraint satisfaction problems, in: Proceedings of CP'04, LNCS, vol. 3258, 2004, pp. 752-756.
42. B. Martin, F. Madeleine, Towards a trichotomy for quantified H-coloring, in: Proceedings of CiE'06, LNCS, vol. 3988, 2006, pp. 342-352.
43. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
44. Pippenger N. Theories of Computability (1997), Cambridge University Press, Cambridge
45. R. Pöschel, L.A. Kalužnin, Funktionen- und Relationenalgebren, DVW, Berlin, 1979.
46. Post E.L. The two-valued iterative systems of mathematical logic. Annals Mathematical Studies vol. 5 (1941), Princeton University Press
47. O. Reingold, Undirected ST-connectivity in log-space, in: Proceedings of STOC'05, 2005, pp. 376-385.
48. Rintanen J. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10 (1999) 323-352
49. M. Rychlik, On probabilistic quantified satisfiability games, in: Proceedings of MFCS'03, LNCS, vol. 2747, 2003, pp. 652-661.
50. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of STOC'78, 1978, pp. 216-226.
51. Schaefer T.J. On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences 16 2 (1978) 185-225
52. A. Szendrei, Clones in Universal Algebra, Seminaires de Mathematiques Superieures, vol. 99, University of Montreal, 1986.
53. R. Williams, Algorithms for quantified Boolean formulas, in: Proceedings of SODA'02, 2002, pp. 299-307.