Abstract
The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of classical constraint satisfaction problem in which some variables can be universally quantified. This additional expressiveness can help model problems in which a subset of the variables take value assignments that are outside the control of the decision maker. Typical examples of such domains are game-playing, conformant planning and reasoning under uncertainty. In these domains decision makers need explanations when a QCSP does not admit a winning strategy. We extend our previous approach to defining preferences amongst the requirements of a QCSP by considering more general relaxation schemes. We also present key complexity results on the hardness of finding preferred conflicts of QCSPs under this extension of the notion of preference. This paper unifies work from the fields of constraint satisfaction, explanation generation, and reasoning under preferences and uncertainty.
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
Notes
- 1.
A relaxation of a requirement is also a requirement.
References
Chen, H.: The Computational Complexity of Quantified Constraint Satisfaction. Ph.D. thesis, Cornell, August 2004
Junker, U.: Quickxplain: preferred explanations and relaxations for over-constrained problems. In: Proceedings of AAAI 2004, pp. 167–172 (2004)
Verger, G., Bessière, C.: : A bottom-up approach for solving quantified csps. In: Proceedings of CP, pp. 635–649 (2006)
Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-solve: a solver for quantified constraint satisfaction problems. In: Proceedings of IJCAI, pp. 138–143 (2005)
Mehta, D., O’Sullivan, B., Quesada, L.: Preferred explanations for quantified constraint satisfaction problems. In: 22nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010, Arras, France, 27–29 October 2010, vol. 1, pp. 275–278. IEEE Computer Society (2010)
Bordeaux, L., Monfroy, E.: Beyond NP: arc-consistency for quantified constraints. In: Proceedings of CP 2002, pp. 371–386 (2002)
Stynes, D., Brown, K.N.: Realtime online solving of quantified CSPs. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 771–786. Springer, Heidelberg (2009)
Ferguson, A., O’Sullivan, B.: Quantified constraint satisfaction problems: from relaxations to explanations. In: Proceedings of IJCAI-2007, pp. 74–79 (2007)
Brafman, R.I., Domshlak, C.: Introducing variable importance tradeoffs into CP-Nets. In: UAI, pp. 69–76 (2002)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the The Theory of NP-Completeness. W. H Freeman and Company, New York (1979)
Scholl, C., Becker, B.: Checking equivalence for partial implementations. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, June 18–22, pp. 238–243. ACM (2001)
Miller, C., Kupferschmid, S., Lewis, M., Becker, B.: Encoding Techniques, craig interpolants and bounded model checking for incomplete designs. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 194–208. Springer, Heidelberg (2010)
Benedetti, M., Lallouet, A., Vautard, J.: QCSP made practical by virtue of restricted quantification. In: Veloso, M.M. (ed.) IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6–12 2007, pp. 38–43 (2007)
Brewka, G.: Answer sets and qualitative optimization. Log. J IGPL 14(3), 413–433 (2006)
Confalonieri, R., Nieves, J.C., Osorio, M., Vázquez-Salceda, J.: Dealing with explicit preferences and uncertainty in answer set programming. Ann. Math. Artif. Intell. 65(2–3), 159–198 (2012)
Acknowldedgement
This material is based upon work supported by the Science Foundation Ireland under Grant No.10/CE/I1853 and the FP7 Programme (FP7/2007–2013) under grant agreement No. 318137 (DISCUS). The Insight Centre for Data Analytics is also supported by Science Foundation Ireland under Grant No. SFI/12/RC/2289.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mehta, D., O’Sullivan, B., Quesada, L. (2015). Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems. In: Leucker, M., Rueda, C., Valencia, F. (eds) Theoretical Aspects of Computing - ICTAC 2015. ICTAC 2015. Lecture Notes in Computer Science(), vol 9399. Springer, Cham. https://doi.org/10.1007/978-3-319-25150-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-25150-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25149-3
Online ISBN: 978-3-319-25150-9
eBook Packages: Computer ScienceComputer Science (R0)