CP-nets and possibilistic logic : Two approaches to preference modeling Steps towards a comparison

This paper proposes a first comparative study of the expressive power of two approaches to the representation of preferences: the CP-net and the possibilistic logic frameworks. It is shown that the second approach, using a method for handling symbolic priority weights, can always provide complete preorders compatible with the partial CP-net order. It is also pointed out that the counterpart of possibilistic logic in terms of conditional preference statements induce constraints which are generally weaker than the ones generated by the ceteris paribus principle. However, it enables the expression of default preferences. TCP-nets and their possibilistic counterpart are also briefly discussed. Lastly, the extension of the possibilistic approach to non-binary preferences is outlined.

[1]  Didier Dubois,et al.  Expressing Preferences from Generic Rules and Examples - A Possibilistic Approach Without Aggregation Function , 2005, ECSQARU.

[2]  Nic Wilson,et al.  Extending CP-Nets with Stronger Conditional Preference Statements , 2004, AAAI.

[3]  Jérôme Lang,et al.  Expressive Power and Succinctness of Propositional Languages for Preference Representation , 2004, KR.

[4]  Didier Dubois,et al.  Possibilistic Merging and Distance-Based Fusion of Propositional Information , 2002, Annals of Mathematics and Artificial Intelligence.

[5]  Didier Dubois,et al.  Towards a Possibilistic Logic Handling of Preferences , 1999, Applied Intelligence.

[6]  Craig Boutilier,et al.  CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments , 2004 .

[7]  Didier Dubois,et al.  Representing preferences in the possibilistic setting , 2004, Preferences.

[8]  Ronen I. Brafman,et al.  Introducing Variable Importance Tradeoffs into CP-Nets , 2002, UAI.

[9]  Jon Doyle,et al.  Efficient utility functions for ceteris paribus preferences , 2002, AAAI/IAAI.

[10]  Henri Prade,et al.  A Theoretical Framework for Possibilistic Independence in a Weakly Ordered Setting , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[11]  Souhila Kaci,et al.  A possibilistic logic handling of strong preferences , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).

[12]  J. Lang.  Possibilistic Logic: Complexity and Algorithms , 2000 .

[13]  Ronen I. Brafman,et al.  Reasoning With Conditional Ceteris Paribus Preference Statements , 1999, UAI.

[14]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[15]  M. Berthold,et al.  International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , 1998 .

[16]  H. Prade,et al.  Possibilistic logic , 1994 .