Abstract
Quantified Constraint Satisfaction Problems are considerably more difficult to solve than classical CSP and the pruning obtained by local consistency is of crucial importance. In this paper, instead of designing specific consistency operators for constraints w.r.t each possible quantification pattern, we propose to build them by relying on classical existential propagators and a few analysis of some mathematical properties of the constraints. It allows to reuse a large set of constraints already carefully implemented in existing solvers. Moreover, multiple levels of consistency for quantified constraint can be defined by choosing which analysis to use. This can be used to control the complexity of the pruning effort. We also introduce QeCode, a full-featured publicly available quantified constraint solver, built on top of Gecode.
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
Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science 221(1-2), 179–210 (1999)
Bordeaux, L.: Résolution de problèmes combinatoire modélisés par des contraintes quantifiées, PhD thesis (2003)
Bordeaux, L.: Boolean and interval propagation for quantified constraints. In: Gent, I., Giunchiglia, E., Stergiou, K. (eds.) Workshop on Quantification in Constraint Programming, 2005, Barcelona, Spain (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, Stanford (2005)
Bordeaux, L., Monfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Hentenryck, P.V. (ed.) CP 2002. LNCS, vol. 2470, pp. 371–386. Springer, Heidelberg (2002)
Gent, I.P., Nightingale, P., Rowley, A.: Encoding quantified CSPs as quantified boolean formulae. In: de Mántaras, R.L., Saitta, L. (eds.) ECAI, pp. 176–180. IOS Press, Amsterdam (2004)
Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-Solve: A solver for quantified constraint satisfaction problems. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 138–143. Professional Book Center (2005)
Nightingale, P.: Consistency for quantified constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 792–796. Springer, Heidelberg (2005)
Schulte, C., Tack, G.: Views and iterators for generic constraint implementations. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 817–821. Springer, Heidelberg (2005)
Stergiou, K.: Repair-based methods for quantified csps. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 652–666. Springer, Heidelberg (2005)
van Beek, P. (ed.): CP 2005. LNCS, vol. 3709, pp. 1–5. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benedetti, M., Lallouet, A., Vautard, J. (2007). Reusing CSP Propagators for QCSPs. In: Azevedo, F., Barahona, P., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2006. Lecture Notes in Computer Science(), vol 4651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73817-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-73817-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73816-9
Online ISBN: 978-3-540-73817-6
eBook Packages: Computer ScienceComputer Science (R0)