Abstract
The generalization of the satisfiability problem with arbitrary quantifiers is a challenging problem of both theoretical and practical relevance. Being PSPACE-complete, it provides a canonical model for solving other PSPACE tasks which naturally arise in AI.
Effective SAT-based solvers have been designed very recently for the special case of boolean constraints. We propose to consider the more general problem where constraints are arbitrary relations over finite domains. Adopting the viewpoint of constraint-propagation techniques so successful for CSPs, we provide a theoretical study of this problem. Our main result is to propose quantified arc-consistency as a natural extension of the classical CSP notion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
K. R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1–2):179–210, 1999.
J. L. Balcázar. The complexity of searching implicit graphs. Artificial Intelligence, 86(1):171–188, 1996.
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.
H. K. Buening, M. Karpinski, and A. Flogel. Resolution for quantified boolean formulas. Information and Computation, 117(1):12–18, 1995.
T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1–2):165–204, 1994.
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.
P. Codognet and D. Diaz. Compiling constraints in CLP(FD). J. of Logic Programming, 27(3):185–226, 1996.
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.
R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283–308, 1997.
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.
T. W. Fruehwirth. Theory and practice of Constraint Handling Rules. J. of Logic Programming, 37(1–3):95–138, 1998.
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.
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.
G. Gottlob. Complexity results for nonmonotonic logics. J. of Logic and Computation, 2(3):397–425, 1992.
C. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
S. Ratschan. Continuous first-order constraint satisfaction. In Artificial Intelligence, Automated Reasoning, and Symbolic Computation, number 2385 in LNCS, Marseille, France, 2002. Springer.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bordeaux, L., Monfroy, E. (2002). Beyond NP: Arc-Consistency for Quantified Constraints. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive