Abstract
The generalization of the constraint satisfaction problem with universal quantifiers is a challenging PSPACE-complete problem, which is interesting theoretically and also relevant to solving other PSPACE problems arising in AI, such as reasoning with uncertainty, and multiplayer games. I define two new levels of consistency for QCSP, and give an algorithm to enforce consistency for one of these definitions. The algorithm is embedded in backtracking search, and tested empirically. The aims of this work are to increase the facilities available for modelling and to increase the power of constraint propagation for QCSPs. The work is motivated by examples from adversarial games.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Constraint Satisfaction Problem
- Partial Assignment
- Domain Support
- Universal Variable
- Existential Variable
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Mamoulis, N., Stergiou, K.: Algorithms for Quantified Constraint Satisfaction Problems. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 752–756. Springer, Heidelberg (2004)
Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. To appear in Proc. of the 19th IJCAI (2005)
Bordeaux, L., Monfroy, E.: Beyond NP: Arc-Consistency for Quantified Constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 371–386. Springer, Heidelberg (2002)
Bessiére, C., Régin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proc. of the 15th IJCAI, pp. 398–404 (1997)
Gent, I., Rowley, A.: Encoding Connect-4 using Quantified Boolean Formulae, APES Technical Report APES-68-2003 (2003)
Lépez-Ortiz, A., Quimper, C.-G., Tromp, J., van Beek, P.: A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint. In: Proc. of the 18th IJCAI, pp. 306–319 (2003)
Mohr, R., Masini, G.: Good Old Discrete Relaxation. In: Proc. of the 8th ECAI, pp. 651–656 (1988)
Nightingale, P.: Consistency for Quantified Constraint Satisfaction Problems, CP-Pod Technical Report CPPOD-11-2005 (2005), Available from http://www.dcs.st-and.ac.uk/~cppod/publications/reports/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nightingale, P. (2005). Consistency for Quantified Constraint Satisfaction Problems. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_66
Download citation
DOI: https://doi.org/10.1007/11564751_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)