Abstract
Conditional preference networks (CP-nets) are a simple approach to the compact representation of preferences. In spite of their merit the application of the ceteris paribus principle underlying them is too global and systematic and sometimes leads to questionable incomparabilities. Moreover there is a natural need for expressing default preferences that generally hold, together with more specific ones that reverse them. This suggests the introduction of priorities for handling preferences in a more local way. After providing the necessary background on CP-nets and identifying the representation issues, the paper presents a logical encoding of preferences under the form of a partially ordered base of logical formulas using a discrimin ordering of the preferences. It is shown that it provides a better approximation of CP-nets than other approaches. This approximation is faithful w.r.t. the strict preferences part of the CP-net and enables a better control of the incomparabilites. Its computational cost remains polynomial w.r.t. the size of the CP-net. The case of cyclic CP-nets is also discussed.
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
Benferhat, S., Lagrue, S., Papini, O.: Reasoning with partially ordered information in a possibilistic logic Framework. Fuzzy Sets and Systems 144(1), 25–41 (2004)
Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. JAIR 21, 135–191 (2004)
Brafman, R., Dimopoulos, Y.: A new look at the semantics and optimization methods of CP-networks. Computational Intelligence 20(2), 137–157 (2004)
Brafman, R.I., Domshlak, C.: Introducing variables importance tradeoffs into CP-Nets. In: UAI 2002, pp. 69–76 (2002)
Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: IJCAI 1989, pp. 1043–1048 (1989)
Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: IJCAI 2003, pp. 867–872 (2003)
Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive power and succinctness of propositional languages for preference representation. In: KR 2004, pp. 203–212 (2004)
Dimopoulos, Y., Moraitis, P., Tsoukias, A.: Extending variable importance in preference networks. In: IJCAI 2005 Workshop on Preferences (2005)
Domshlak, C., Venable, B., Rossi, F., Walsh, T.: Reasoning about soft constraints and conditional preferences. In: IJCAI 2003, pp. 215–220 (2003)
Dubois, D., Kaci, S., Prade, H.: CP-nets and possibilistic logic: Two approaches to preference modeling. Steps towards a comparison. In: IJCAI 2005 Workshop on Preferences (2005)
Halpern, J.: Defining relative likelihood in partially-ordered preferential structure. JAIR 7, 1–24 (1997)
Lang, J.: Logical preference representations and combinatorial vote. Annals on Mathematics and Artificial Intelligence 42(1-3), 37–71 (2004)
McGeachie, M., Doyle, J.: Efficient Utility Functions for Ceteris Paribus Preferences. In: AAAI 2002, pp. 279–284 (2002)
Wilson, N.: Extending CP-nets with stronger conditional preference statements. In: AAAI 2004, pp. 735–741 (2004)
Wilson, N.: An efficient upper approximation for conditional preference. In: ECAI 2006, pp. 472–476 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaci, S., Prade, H. (2007). Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)