Handling partially ordered preferences in possibilistic logic-A survey discussion -

This paper advocates possibilistic logic with partially ordered priority weights as a powerful representation format for handling preferences. An important benefit of such a logical setting is the ability to check the consistency of the specified preferences. We recall how Qualitative Choice Logic statements (and related ones), as well as CP-nets preferences can be represented in this framework. We investigate how a generalization of CP-nets, namely CP-theories, can also be handled in a partially ordered possibilistic logic setting. Finally we suggest how this framework may be used for handling preference queries.

[1]  Didier Dubois,et al.  Modeling "and if possible" and "or at least": Different Forms of Bipolarity in Flexible Querying , 2013, Flexible Approaches in Data, Information and Knowledge Management.

[2]  Henri Prade,et al.  Database preference queries—a possibilistic logic approach with symbolic priorities , 2012, Annals of Mathematics and Artificial Intelligence.

[3]  Didier Dubois,et al.  A Possibilistic Logic View of Sugeno Integrals , 2011, Eurofuse.

[4]  Nic Wilson,et al.  Computational techniques for a simple theory of conditional preferences , 2011, Artif. Intell..

[5]  Eyke Hüllermeier,et al.  Preferences in AI: An overview , 2011, Artif. Intell..

[6]  Henri Prade,et al.  A possibilistic logic view of preference queries to an uncertain database , 2010, International Conference on Fuzzy Systems.

[7]  Nic Wilson,et al.  From Preference Logics to Preference Languages, and Back , 2010, KR.

[8]  Cordell Green.  Theorem-Proving by Resolution as a Basis for Question-Answering Systems , 2010 .

[9]  Didier Dubois,et al.  Modeling positive and negative information in possibility theory , 2008, Int. J. Intell. Syst..

[10]  Henri Prade,et al.  Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic , 2008, ECAI.

[11]  Leon van der Torre,et al.  Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms , 2008, Ann. Oper. Res..

[12]  H. Prade,et al.  Constraints associated with Choquet integrals and other aggregation-free ranking devices , 2008 .

[13]  Henri Prade,et al.  Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities , 2007, ECSQARU.

[14]  Henri Prade,et al.  Ranking Alternatives on the Basis of Generic Constraints and Examples - A Possibilistic Approach , 2007, IJCAI.

[15]  Didier Dubois,et al.  Approximation of Conditional Preferences Networks fiCP-netsfl in Possibilistic Logic , 2006, 2006 IEEE International Conference on Fuzzy Systems.

[16]  Didier Dubois,et al.  Bipolar possibility theory in preference modeling: Representation, fusion and optimal solutions , 2006, Inf. Fusion.

[17]  Henri Prade,et al.  Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic , 2005, IJCAI.

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

[19]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[20]  Salem Benferhat,et al.  Qualitative choice logic , 2004, Artif. Intell..

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

[22]  Didier Dubois,et al.  Possibilistic logic : a retrospective and prospective view , 2003 .

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

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

[25]  Daniel Le Berre,et al.  On the Relationship Between Qualitative Choice Logic and Possibilistic Logic , 2004 .

[26]  Jan Chomicki,et al.  Preference formulas in relational queries , 2003, TODS.

[27]  Souhila Kaci,et al.  Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases , 2003, Artif. Intell..

[28]  Didier Dubois,et al.  Bipolarity in Flexible Querying , 2002, FQAS.

[29]  Didier Dubois,et al.  Possibilistic logic representation of preferences: relating prioritized goals and satisfaction levels expressions , 2002, ECAI.

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

[31]  Didier Dubois,et al.  On the transformation between possibilistic logic bases and possibilistic causal networks , 2002, Int. J. Approx. Reason..

[32]  Didier Dubois,et al.  Bridging Logical, Comparative, and Graphical Possibilistic Representation Frameworks , 2001, ECSQARU.

[33]  M. Lacroix,et al.  Preferences; Putting More Knowledge into Queries , 1987, VLDB.

[34]  D. Dubois,et al.  CP-nets and possibilistic logic : Two approaches to preference modeling Steps towards a comparison , 2022 .