Abstract
The Quantified CSP (QCSP) is a generalisation of the classical CSP in which some of the variables are universally quantified [3].We consider the problem of relaxing an instance of the QCSP when it is unsatisfiable. We propose several novel forms of problem relaxations for the QCSP and present an algorithm for generating conflict-based explanations of inconsistency. Our motivation comes from problems in supply-chain management and conformant planning.
This work was supported by Science Foundation Ireland (Grant 03/CE3/I405). The authors thank Hubie Chen, Helene Fargier and Nic Wilson for their helpful comments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: Definitions and complexity. In: AAAI, pp. 360–365 (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)
Chen, H.: The Computational Complexity of Quantified Constraint Satisfaction. Ph.D thesis, Cornell University (August 2004)
Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artif. Intell. 58(1-3), 21–70 (1992)
Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-solve: A solver for quantified constraint satisfaction problems. In: IJCAI, pp. 138–143 (2005)
Junker, U.: Quickxplain: Preferred explanations and relaxations for over-constrained problems. In: AAAI, pp. 167–172 (2004)
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)
Stergiou, K.: Repair-based methods for quantified cSPs. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 652–666. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferguson, A., O’Sullivan, B. (2006). Relaxations and Explanations for Quantified Constraint Satisfaction Problems. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_52
Download citation
DOI: https://doi.org/10.1007/11889205_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science