Beyond NP: Arc-consistency for quantified constraints

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

Volumn 2470, Issue , 2002, Pages 371-386

  Bordeaux, Lucas ^a   Monfroy, Eric ^a  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ARC CONSISTENCY; BOOLEAN CONSTRAINT; CANONICAL MODELING; CONSTRAINT PROPAGATION TECHNIQUE; NATURAL EXTENSION; PSPACE-COMPLETE; SATISFIABILITY PROBLEMS; THEORETICAL STUDY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957036580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_25     Document Type: Conference Paper

References (21)

1. K. Apt and E. Monfroy. Automatic generation of constraint propagation algorithms for small finite domains. In Proc. of the 5th Int. Conf. on Principles and Practice of Constraint Programming (CP), pages 58–72, Alexandria, Virginia, 1999. Springer.
2. K. R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1-2):179–210, 1999.
3. J. L. Balcázar. The complexity of searching implicit graphs. Artificial Intelligence, 86(1):171–188, 1996.
4. F. Benhamou and F. Goualard. Universally quantified interval constraints. In Proc. of the 6th Int. Conf. on Principles and Practice of Constraint Programming (CP), LNCS, pages 67–82, Singapore, 2000. Springer.
5. H. K. Buening, M. Karpinski, and A. Flogel. Resolution for quantified Boolean formulas. Information and Computation, 117(1):12–18, 1995.
6. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165–204, 1994.
7. M. Cadoli, A Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. of the 15th Nat. Conf. on AI (AAAI), pages 262–267, Madison, USA, 1999. AAAI/MIT Press.
8. P. Codognet and D. Diaz. Compiling constraints in CLP(FD). J. of Logic Programming, 27(3):185–226, 1996.
9. A. Colmerauer and T. Dao. Expressiveness of full first order constraints in the algebra of finite or infinite trees. In Proc. of the 6th Int. Conf. on Principles and Practice of Constraint Programming (CP), LNCS, pages 172–186, Singapore, 2000. Springer.
10. R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283–308, 1997.
11. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving advanced reasoning tasks using quantified boolean formulas. In Proc. of the 17th Nat. Conf. on AI (AAAI), pages 417–422, Austin, TX, 2001. AAAI/MIT Press.
12. T. W. Fruehwirth. Theory and practice of Constraint Handling Rules. J. of Logic Programming, 37(1-3):95–138, 1998.
13. I. P. Gent and T. Walsh. Beyond NP: the QSAT phase transition. In Proc. of the 15th Nat. Conf. on AI (AAAI), pages 648–653, Madison, USA, 1999. AAAI/MIT Press.
14. E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for quantified boolean logic satisfiability. In Proc. of the 18th Nat. Conf. on AI, Edmonton, Alberta, 2002. AAAI/MIT Press. To appear.
15. G. Gottlob. Complexity results for nonmonotonic logics. J. of Logic and Computation, 2(3):397–425, 1992.
16. C. Papadimitriou. Computational Complexity. Addison Wesley, 1994
17. S. Ratschan. Continuous first-order constraint satisfaction. In Artificial Intelligence, Automated Reasoning, and Symbolic Computation, number 2385 in LNCS, Marseille, France, 2002. Springer.
18. J. Rintanen. Improvements to the evaluation of quantified boolean formulae. In Proc. of the 16th Int. Joint Conf. on AI (IJCAI), pages 1192–1197, Stockholm, Sweden, 1999. Morgan Kaufmann.
19. T. J. Schaefer. Complexity of decision problems based on finite two-person perfect-information games. J. of Computer and System Sciences, 16(2):185–225, 1978.
20. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time: Preliminary report. In Conf. Record of the 5th Symp. on the Theory of Computing (STOC), pages 1–9, Austin, TX, 1973. ACM
21. A. C. Ward, T. Lozano-Perez, and W. P. Seering. Extending the constraint propagation of intervals. In Proc. of the 11th Int. Joint Conf. on AI (IJCAI), pages 1453–1460, Detroit, Michigan, 1989. Morgan Kaufmann.