Abstract
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universal ones). Despite the expressiveness of QCSP, many problems, such as two-players games or motion planning of robots, remain difficult to express. Two more modeler-friendly frameworks have been proposed to handle this difficulty, the Strategic CSP and the QCSP + . We define what we name back-propagation on QCSP + . We show how back-propagation can be used to define a goal-driven value ordering heuristic and we present experimental results on board games.
Supported by the ANR project ANR-06-BLAN-0383-02.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ansótegui, C., Gomes, C., Selman, B.: The Achille’s heel of QBF. In: Proceedings AAAI 2005 (2005)
Benedetti, M., Lallouet, A., Vautard, J.: QCSP made practical by virtue of restricted quantification. In: Proceedings of IJCAI 2007, pp. 38–43 (2007)
Bessiere, C., Verger, G.: Strategic constraint satisfaction problems. In: Proceedings CP 2006 Workshop on Modelling and Reformulation, pp. 17–29 (2006)
Bordeaux, L., Montfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 371–386. Springer, Heidelberg (2002)
Choco. Java constraint library, http://choco.sourceforge.net/
Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings ECAI 1992, pp. 31–35 (1992)
Gent, I.P., Nightingale, P., Rowley, A., Stergiou, K.: Solving quantified constraint satisfaction problems. Artif. Intell. 172(6-7), 738–771 (2008)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verger, G., Bessiere, C. (2008). Guiding Search in QCSP + with Back-Propagation. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)