Abstract
In this paper a novel approach to deal with preferences expressed as a mixture of soft constraints and CP nets is presented. We construct a set of hard constraints whose solutions, if optimal for the soft constraints, are the optimal solutions of the set of preferences. This allows us to avoid dominance testing (is one outcome better than another?) which is a very expensive operation often used when finding optimal solutions or testing optimality. This simple and elegant technique permits conventional constraint and SAT solvers to solve problems involving both preferences and soft constraints.
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
References
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Solving and Optimization. Journal of ACM 44(2), 201–236 (1997)
Boutilier, C., Brafman, R., Hoos, H., Poole, D.: Reasoning with conditional ceteris paribus preference statements. In: Proceedings of 15th Annual Conference on Uncertainty in Artificial Intelligence, UAI 1999 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Venable, K.B. (2004). Softly Constrained CP Nets. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_85
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive