Abstract
Solutions to valid Quantified Constraint Satisfaction Problems (QCSPs) are called winning strategies and represent possible ways in which the existential player can react to the moves of the universal one to “win the game”. However, different winning strategies are not necessarily equivalent: some may be preferred to others. We define Quantified Constraint Optimization Problems (QCOP) as a framework which allows both to formally express preferences over QCSP strategies, and to solve the related optimization problem. We present examples and some experimental results. We also discuss how this framework relates to other formalisms for hierarchical decision modeling known as von Stackelberg games and bilevel (and multilevel) programming.
This work is supported by the project ANR-06-BLAN-0383.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nightingale, P.: Consistency for quantified constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 792–796. Springer, Heidelberg (2005)
Bessière, C., Verger, G.: Strategic constraint satisfaction problems. In: Miguel, I., Prestwich, S. (eds.) Workshop on Constraint Modelling and Reformulation, Nantes, France, pp. 17–29 (2006)
Benedetti, M., Lallouet, A., Vautard, J.: QCSP Made Practical by Virtue of Restricted Quantification. In: Veloso, M. (ed.) International Joint Conference on Artificial Intelligence, Hyderabad, India, pp. 38–43. AAAI Press, Menlo Park (2007)
Benedetti, M., Lallouet, A., Vautard, J.: Modeling adversary scheduling with QCSP+. In: ACM Symposium on Applied Computing, Fortaleza, Brazil. ACM Press, New York (2008)
Nightingale, P.: Consistency and the Quantified Constraint Satisfaction Problem. PhD thesis, University of St Andrews (2007)
Bracken, J., McGill, J.: Mathematical programs with optimization problems in the constraints. Operations Research 21, 37–44 (1973)
Stackelberg, H.: The theory of market economy. Oxford University Press, Oxford (1952)
Bialas, W.F.: Multilevel mathematical programming, an introduction. Slides (2002)
Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Annals of Operations Research 153, 235–256 (2007)
QeCode Team: QeCode: An open QCSP+ solver (2008), http://www.univ-orleans.fr/lifo/software/qecode/
Gecode Team: Gecode: Generic constraint development environment (2006), http://www.gecode.org
Benedetti, M.: Extracting certificates from quantified boolean formulas. In: Kaelbling, L.P., Saffiotti, A. (eds.) International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, pp. 47–53. Professional Book Center (2005)
Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: Definitions and complexity. In: Veloso, M.M., Kambhampati, S. (eds.) National Conference on Artificial Intelligence, pp. 360–365. AAAI Press, Menlo Park (2005)
Walsh, T.: Stochastic constraint programming. In: ECAI, pp. 111–115 (2002)
Bouhtou, M., Grigoriev, A., van Hoesel, S., van der Kraaij, A.F., Spieksma, F.C., Uetz, M.: Pricing bridges to cross a river. Naval Research Logistics 54(4), 411–420 (2007)
Audestad, J.A., Gaivoronski, A.A., Werner, A.: Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector. Annals of Operations Research 142(1), 19–39 (2006)
Pralet, C., Verfaillie, G., Schiex, T.: An algebraic graphical model for decision with uncertainties, feasibilities, and utilities. Journal of Artificial Intelligence Research 29, 421–489 (2007)
Bordeaux, L., Hamadi, Y., Quimper, C.G., Samulowitz, H.: Expressions Itérées en Programmation par Contraintes. In: Fages, F. (ed.) Journées Francophones de Programmationpar Contraintes, pp. 98–107 (2007)
Chen, H., Pál, M.: Optimization, games, and quantified constraint satisfaction. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 239–250. 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
Benedetti, M., Lallouet, A., Vautard, J. (2008). Quantified Constraint Optimization. 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_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_31
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)