Approximation of Conditional Preferences Networks “CP-nets” in Possibilistic Logic

Didier Dubois (1) , Souhila Kaci (2) , Henri Prade (1)

1 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
2 CRIL - Centre de Recherche en Informatique de Lens

This paper proposes a first comparative study of the expressive power of two approaches to the representation of preferences: conditional preferences networks (CP-nets) and a logical preference representation framework, namely possibilistic logic. It is shown that possibilistic logic, using a method for handling symbolic priority weights, can always provide complete preorders compatible with the partial CPnet order. Although CP-nets provide an intuitive appealing setting for expressing preferences, possibilistic logic appears to be somewhat more flexible for that purpose.

Mots clés: approximation theory; possibility theory; fuzzy systems

Domaines: Intelligence artificielle [cs.AI]

Didier Dubois, Souhila Kaci, Henri Prade. Approximation of Conditional Preferences Networks “CP-nets” in Possibilistic Logic. IEEE International Conference on Fuzzy Systems (FUZZ IEEE 2006), Jul 2006, Vancouver, Canada. pp.2337-2342, ⟨10.1109/FUZZY.2006.1682025⟩. ⟨hal-03364220⟩