Abstract
In interactive decision-making settings, such as product configuration, users are stating preferences, or foreground constraints, over a set of possible solutions, as defined by background constraints. When the foreground constraints introduce inconsistencies with the background constraints, we wish to find explanations that help the user converge to a solution. In order to provide satisfactory explanations, it can be useful to know one or several subsets of conflicting constraints; such a subset is called a conflict. When computing such conflicts is intractable in an interactive context, we can choose to compile the problem so as to allow faster response times. In this paper we propose a new representation, which implicitly encompasses all conflicts possibly introduced by a user’s choices. We claim that it can help in situations where extra information about conflicts is needed, such as when explanations of inconsistency are required.
This work was supported by Science Foundation Ireland (Grant Number 05/IN/I886).
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
Chatalic, P., Simon, L.: Multi-resolution on compressed sets of clauses. In: ICTA, pp. 2–10. IEEE Computer Society, Los Alamitos (2000)
Coudert, O., Madre, J.C.: A New Method to Compute Prime and Essential Prime Implicants of Boolean Functions. In: Advanced Research in VLSI and Parallel Systems: Proceedings of the 1992 Brown/MIT Conference. MIT Press, Cambridge (1992)
Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res (JAIR) 17, 229–264 (2002)
de Kleer, J.: An improved incremental algorithm for generating prime implicates. In: AAAI, pp. 780–785 (1992)
de Kleer, J., Mackworth, A.K., Reiter, R.: Characterizing diagnoses and systems. Artif. Intell. 56(2-3), 197–222 (1992)
del Val, A.: Tractable databases: How to make propositional unit resolution complete through compilation. In: KR, pp. 551–561 (1994)
del Val, A.: A new method for consequence finding and compilation in restricted languages. In: AAAI/IAAI, pp. 259–264 (1999)
del Val, A.: The complexity of restricted consequence finding and abduction. In: AAAI/IAAI, pp. 337–342. AAAI Press/The MIT Press (2000)
Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77–92. Springer, Heidelberg (2001)
Junker, U.: QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems. In: McGuinness, D.L., Ferguson, G. (eds.) AAAI, pp. 167–172. AAAI Press/The MIT Press (2004)
Junquera, B.P., González, C.A.: Possible conflicts: a compilation technique for consistency-based diagnosis. IEEE Transactions on Systems, Man, and Cybernetics, Part B 34(5), 2192–2206 (2004)
Katsirelos, G., Bacchus, F.: Generalized nogoods in csps. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 390–396. AAAI Press/The MIT Press (2005)
Kean, A., Tsiknis, G.K.: An incremental method for generating prime implicants/impicates. J. Symb. Comput. 9(2), 185–206 (1990)
Marquis, P.: Consequence finding algorithms. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 5, pp. 41–145 (2000)
Marquis, P.: Knowledge compilation using theory prime implicates. In: IJCAI (1), pp. 837–845 (1995)
O’Sullivan, B., Papadopoulos, A., Faltings, B., Pu, P.: Representative explanations for over-constrained problems. In: AAAI, pp. 323–328. AAAI Press, Menlo Park (2007)
Papadopoulos, A., O’Sullivan, B.: Relaxations for compiled over-constrained problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 433–447. Springer, Heidelberg (2008)
Simon, L., del Val, A.: Efficient consequence finding. In: Nebel, B. (ed.) IJCAI, pp. 359–370. Morgan Kaufmann, San Francisco (2001)
Tison, P.: Generalization of consensus theory and application to the minimization of boolean functions. IEEE Transactions on Electronic Computers 16(4), 446–456 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papadopoulos, A., O’Sullivan, B. (2009). Compiling All Possible Conflicts of a CSP. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)