Abstract
CP-nets (Conditional preference networks) are a well-known compact graphical representation of preferences in Artificial Intelligence, that can be viewed as a qualitative counterpart to Bayesian nets. In case of binary attributes it captures specific partial orderings over Boolean interpretations where strict preference statements are defined between interpretations which differ by a single flip of an attribute value. It respects preferential independence encoded by the ceteris paribus property. The popularity of this approach has motivated some comparison with other preference representation setting such as possibilistic logic. In this paper, we focus our discussion on the possibilistic representation of CP-nets, and the question whether it is possible to capture the CP-net partial order over interpretations by means of a possibilistic knowledge base and a suitable semantics. We show that several results in the literature on the alleged faithful representation of CP-nets by possibilistic bases are questionable. To this aim we discuss some canonical examples of CP-net topologies where the considered possibilistic approach fails to exactly capture the partial order induced by CP-nets, thus shedding light on the difficulties encountered when trying to reconcile the two frameworks.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Domshlak, C., Hüllermeier, E., Kaci, S., Prade, H.: Preferences in AI: An overview. Artif. Intell. 175, 1037–1052 (2011)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artificial Intelligence Research (JAIR) 21, 135–191 (2004)
Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets and Systems 144, 3–23 (2004)
Benferhat, S., Dubois, D., Prade, H.: Towards a possibilistic logic handling of preferences. Applied Intelligence 14, 303–317 (2001)
Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Possibilistic logic representation of preferences: relating prioritized goals and satisfaction levels expressions. In: Proc. 15th. Europ. Conf. on Artificial Intelligence (ECAI 2002), Lyon, July 21-26, pp. 685–689. IOS Press (2002)
Dubois, D., Kaci, S., Prade, H.: CP-nets and possibilistic logic: Two approaches to preference modeling. Steps towards a comparison. In: Proc. of IJCAI 2005 Workshop on Advances in Preference Handling, Edinburg, July 31-August 1 (2005)
Dubois, D., Kaci, S., Prade, H.: Approximation of conditional preferences networks “CP-nets” in possibilistic logic. In: Proc. Inter. Conf. on Fuzzy Systems (FUZZ-IEEE), Vancouver, July 16-21, pp. 2337–2342 (2006)
Kaci, S., Prade, H.: Mastering the processing of preferences by using symbolic priorities. In: Proc. 18th Europ. Conf. on Artif. Intel. (ECAI 2008), pp. 376–380 (2008)
Kaci, S.: Working With Preferences: Less Is More. Springer (2012)
Dubois, D., Prade, H., Touazi, F.: Handling partially ordered preferences in possibilistic logic - A survey discussion. In: Proc. ECAI 2012 Workshop on Weighted Logics for AI, pp. 91–98 (2012)
Benferhat, S., Prade, H.: Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proc. 19th Int. Joint Conf. on Artif. Intellig. (IJCAI 2005), Edinburgh, July 30-August 5, pp. 1281–1286 (2005)
Wilson, N.: Extending CP-nets with stronger conditional preference statements. In: Proc. 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 735–741 (2004)
Kaci, S., Prade, H.: Relaxing ceteris paribus preferences with partially ordered priorities. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 660–671. Springer, Heidelberg (2007)
HadjAli, A., Kaci, S., Prade, H.: Database preference queries - A possibilistic logic approach with symbolic priorities. Ann. Math. Artif. Intell. 63, 357–383 (2011)
Bienvenu, M., Lang, J., Wilson, N.: From preference logics to preference languages, and back. In: Lin, F.Z., Sattler, U., Truszczynski, M. (eds.) Proc. 12th Int. Conf. on Principles of Knowled. Represent. and Reas. (KR 2010), Toronto, pp. 414–424. AAAI (2010)
Wilson, N.: Computational techniques for a simple theory of conditional preferences. Artif. Intell. 175, 1053–1091 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubois, D., Prade, H., Touazi, F. (2013). Conditional Preference Nets and Possibilistic Logic. In: van der Gaag, L.C. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2013. Lecture Notes in Computer Science(), vol 7958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39091-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-39091-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39090-6
Online ISBN: 978-3-642-39091-3
eBook Packages: Computer ScienceComputer Science (R0)