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

Abstract

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.

References in corpus (2)

• Structure and Complexity in Planning with Unary Operators
• Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

Cited by in corpus (11)

• Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
• On Solving Boolean Multilevel Optimization Problems
• CP-nets and Nash equilibria
• I Don't Want to Think About it Now:Decision Theory With Costly Computation
• Monotonic and Nonmonotonic Preference Revision
• Solving planning domains with polytree causal graphs is NP-complete
• A comparison of the notions of optimality in soft constraints and graphical games
• A Primer on Strategic Games
• Contracting preference relations for database applications
• Database Querying under Changing Preferences
• Comparing the notions of optimality in CP-nets, strategic games and soft constraints