Abstract
The problem of finding an optimal solution in a constraint satisfaction problem with preferences has attracted a lot of researchers in Artificial Intelligence in general, and in the constraint programming community in particular. As a consequence, several approaches for expressing and reasoning about satisfiability problems with preferences have been proposed, and viable solutions exist for finding one optimal solution. However, in many cases, it is not desirable to find just one solution. Indeed, it might be desirable to be able to compute more, and possibly all, optimal solutions, e.g., for comparatively evaluate them on the basis of other criteria not captured by the preferences.
In this paper we present a procedure for computing all optimal solutions of a satisfiability problem with preferences. The procedure is guaranteed to compute all and only the optimal solutions, i.e., models which are not optimal are not even computed.
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.
Similar content being viewed by others
References
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res (JAIR) 21, 135–191 (2004)
Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: Proc. of 17th European Conference on Artificial Intelligence (ECAI), pp. 377–381 (2006)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Preference-based constrained optimization with CP-nets. Computational Intelligence 20(2), 137–157 (2004)
Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4), 373–399 (2005)
Giunchiglia, E., Maratea, M.: Planning as satisfiability with preferences. In: Proc. of 22nd AAAI Conference on Artificial Intelligence, pp. 987–992. AAAI Press, Menlo Park (2007)
Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem proving. Communication of ACM 5(7), 394–397 (1962)
Tseitin, G.: On the complexity of proofs in propositional logics. Seminars in Mathematics 8 (1970); Reprinted in [9]
Plaisted, D.A., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation 2, 293–304 (1986)
Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning: Classical Papers in Computational Logic 1967–1970, vol. 1-2. Springer, Heidelberg (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Rosa, E., Giunchiglia, E., Maratea, M. (2008). Computing All Optimal Solutions in Satisfiability Problems with Preferences. 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_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_50
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)