×

Relaxing ceteris paribus preferences with partially ordered priorities. (English) Zbl 1148.68521

Mellouli, Khaled (ed.), Symbolic and quantitative approaches to reasoning with uncertainty. 9th European conference, ECSQARU 2007, Hammamet, Tunisia, October 31–November 2, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75255-4/pbk). Lecture Notes in Computer Science 4724. Lecture Notes in Artificial Intelligence, 660-671 (2007).
Summary: 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.
For the entire collection see [Zbl 1143.68010].

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
68T27 Logic in artificial intelligence

Software:

CP-nets
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] 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) · Zbl 1076.68080 · doi:10.1016/j.fss.2003.10.012
[2] 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) · Zbl 1080.68685
[3] Brafman, R., Dimopoulos, Y.: A new look at the semantics and optimization methods of CP-networks. Computational Intelligence 20(2), 137–157 (2004) · doi:10.1111/j.0824-7935.2004.00236.x
[4] Brafman, R.I., Domshlak, C.: Introducing variables importance tradeoffs into CP-Nets. In: UAI 2002, pp. 69–76 (2002)
[5] Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: IJCAI 1989, pp. 1043–1048 (1989) · Zbl 0713.68053
[6] Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: IJCAI 2003, pp. 867–872 (2003)
[7] 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)
[8] Dimopoulos, Y., Moraitis, P., Tsoukias, A.: Extending variable importance in preference networks. In: IJCAI 2005 Workshop on Preferences (2005)
[9] Domshlak, C., Venable, B., Rossi, F., Walsh, T.: Reasoning about soft constraints and conditional preferences. In: IJCAI 2003, pp. 215–220 (2003) · Zbl 1125.68410
[10] 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)
[11] Halpern, J.: Defining relative likelihood in partially-ordered preferential structure. JAIR 7, 1–24 (1997) · Zbl 0895.03010
[12] Lang, J.: Logical preference representations and combinatorial vote. Annals on Mathematics and Artificial Intelligence 42(1-3), 37–71 (2004) · Zbl 1061.68147 · doi:10.1023/B:AMAI.0000034522.25580.09
[13] McGeachie, M., Doyle, J.: Efficient Utility Functions for Ceteris Paribus Preferences. In: AAAI 2002, pp. 279–284 (2002)
[14] Wilson, N.: Extending CP-nets with stronger conditional preference statements. In: AAAI 2004, pp. 735–741 (2004)
[15] Wilson, N.: An efficient upper approximation for conditional preference. In: ECAI 2006, pp. 472–476 (2006)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.