CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements

Information about user preferences plays a key role in automated decision making. In many domains it is desirable to assess such preferences in a qualitative rather than quantitative way. In this paper, we propose a qualitative graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else being equal) interpretation. Such a representation is often compact and arguably quite natural in many circumstances. We provide a formal semantics for this model, and describe how the structure of the network can be exploited in several inference tasks, such as determining whether one outcome dominates (is preferred to) another, ordering a set outcomes according to the preference relation, and constructing the best outcome subject to available evidence.

[1]  Soren Hallden,et al.  On the logic of "better" , 1957 .

[2]  D. Davidson.  The Logic of Preference: An Essay. , 1966 .

[3]  G. Wright.  The logic of preference reconsidered , 1972 .

[4]  J. Dyer.  Interactive Goal Programming , 1972 .

[5]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  S. M. Junaid Zaidi,et al.  Linear Programming in Single and Multiple Objective Systems , 1982 .

[7]  James P. Ignizio,et al.  Linear Programming in Single- and Multiple-Objective Systems , 1984 .

[8]  R. Trapp.  Utility theory and preference logic , 1985 .

[9]  Yoav Shoham,et al.  A semantical approach to nonmonotonic logics , 1987, LICS 1987.

[10]  John Nolt.  Philosophical Logic: Philosophical Papers, Volume II. , 1988 .

[11]  Ronald A. Howard,et al.  Readings on the Principles and Applications of Decision Analysis , 1989 .

[12]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[13]  Jon Doyle,et al.  Preferential Semantics for Goals , 1991, AAAI.

[14]  Jon Doyle,et al.  A Logic of Relative Desire (Preliminary Report) , 1991, ISMIS.

[15]  Craig Boutilier,et al.  Toward a Logic for Qualitative Decision Theory , 1994, KR.

[16]  Judea Pearl,et al.  Specification and Evaluation of Preferences for Planning under Uncertainty , 1994 .

[17]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[18]  Craig A. Knoblock.  Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[19]  Pattie Maes,et al.  Collaborative Interface Agents , 1994, AAAI.

[20]  J. Doyle,et al.  Representing Preferences as Ceteris Paribus Comparatives , 1994 .

[21]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[22]  Fahiem Bacchus,et al.  Graphical models for preference and utility , 1995, UAI.

[23]  William P. Birmingham,et al.  Preference-directed design , 1995, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[24]  Fahiem Bacchus,et al.  Utility Independence in a Qualitative Decision Theory , 1996, KR.

[25]  Sven Ove Hansson.  What is ceteris paribus preference? , 1996, J. Philos. Log..

[26]  Ulrich Junker,et al.  A Cumulative-Model Semantics for Dynamic Preferences on Assumptions , 1997, IJCAI.

[27]  Didier Dubois,et al.  A Possibilistic Logic Machinery for Qualitative Decision , 1997, AAAI 1997.

[28]  Craig Boutilier,et al.  A Constraint-Based Approach to Preference Elicitation and Decision Making , 1997 .

[29]  Yoav Shoham.  Conditional Utility, Utility Independence, and Utility Networks , 1997, UAI.

[30]  Daniel Sabin,et al.  Product Configuration Frameworks - A Survey , 1998, IEEE Intell. Syst..

[31]  Peter Haddawy,et al.  The Decision-Theoretic Video Advisor* , 1998 .

[32]  Yuval Shahar,et al.  Utility Elicitation as a Classification Problem , 1998, UAI.

[33]  Didier Dubois,et al.  Making Decision in a Qualitative Setting: from Decision under Uncertaintly to Case-based Decision , 1998, KR.

[34]  Albert Haag,et al.  Sales Configuration in Business Processes , 1998, IEEE Intell. Syst..

[35]  Didier Dubois,et al.  Logical Representation and Computation of Optimal Decisions in a Qualitative Setting , 1998, AAAI/IAAI.

[36]  Peter Haddawy,et al.  Toward Case-Based Preference Elicitation: Similarity Measures on Preference Structures , 1998, UAI.

[37]  I. Niemelä,et al.  Formalizing configuration knowledge using rules with choices , 1998 .

[38]  Yoav Shoham,et al.  Expected Utility Networks , 1999, UAI.

[39]  Peter Haddawy,et al.  The Decision-Theoretic Interactive Video Advisor , 1999, UAI.

[40]  Ronen I. Brafman,et al.  Strucutre and Complexitiy in Planning with Unary Operators , 2000, PuK.

[41]  Ronen I. Brafman,et al.  Preference-Based Configuration of Web Page Content , 2001, IJCAI.

[42]  Ronen I. Brafman,et al.  UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.

[43]  Barry O'Sullivan,et al.  Modeling and Generating Tradeoffs for Constraint-Based Configuration , 2001 .

[44]  Ulrich Junker.  Preference Programming for Configuration , 2001 .

[45]  Ronen I. Brafman,et al.  CP-nets: Reasoning and Consistency Testing , 2002, KR.

[46]  Ehud Gudes,et al.  Remote Conferencing with Multimedia Objects , 2002, EDBT Workshops.

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

[48]  Carmel Domshlak,et al.  On Recursively Directed Hypercubes , 2001, Electron. J. Comb..

[49]  Carmel Domshlak,et al.  Modeling and Reasoning about Preferences with CP-nets , 2002 .

[50]  C. Domshlak,et al.  Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques , 2003, International Joint Conference on Artificial Intelligence.

[51]  Ronen I. Brafman,et al.  A New Look at the Semantics and Optimization Methods of CP-Networks , 2009, IJCAI.

[52]  Carmel Domshlak,et al.  Efficient Probabilistic Reasoning in Bayes Nets with Mutual Exclusion and Context Specific Independence , 2003, FLAIRS.

[53]  Carmel Domshlak,et al.  Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks , 2003, Artif. Intell..

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