Conditional preference nets and possibilistic logic

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 7958 LNAI pp. 181 - 193
Issue Date:
2013-08-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007822OK.pdf Published version385.89 kB
Adobe PDF
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. © 2013 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: