Upside-Down Preference Reversal: How to Override Ceteris-Paribus Preferences?
نویسنده
چکیده
Specific preference statements may reverse general preference statements, thus constituting a change of attitude in particular situations. We define a semantics of preference reversal by relaxing the popular ceteris-paribus principle. We characterize preference reversal as default reasoning and we link it to prioritized Pareto-optimization, which permits a natural computation of preferred solutions. The resulting method simplifies elicitation, representation, and utilization of complex preference relations and may thus enable a more realistic preference handling in personalized decision support systems and in preference-based intelligent systems.
منابع مشابه
Utility Functions for Ceteris Paribus Preferences
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric utility function representations to achieve computational efficiency. We provide algorithms, complete for finite universes of binary features, for converting a set of qualitative ceteris paribus preferences into quantit...
متن کاملEverything Else Being Equal: A Modal Logic for Ceteris Paribus Preferences
This paper presents a new modal logic for ceteris paribus preferences understood in the sense of “all other things being equal”. This reading goes back to the seminal work of Von Wright in the early 1960’s and has returned in computer science in the 1990’s and in more abstract “dependency logics” today. We show how it differs from ceteris paribus as “all other things being normal”, which is use...
متن کاملAn Empirical Investigation of Ceteris Paribus Learnability
Eliciting user preferences constitutes a major step towards developing recommender systems and decision support tools. Assuming that preferences are ceteris paribus allows for their concise representation as Conditional Preference Networks (CP-nets). This work presents the first empirical investigation of an algorithm for reliably and efficiently learning CP-nets in a manner that is minimally i...
متن کاملReasoning With Conditional Ceteris Paribus Preference Statements
In many domains it is desirable to assess the preferences of users in a qualitative rather than quantitative way. Such representations of qualitative preference orderings form an important component of automated decision tools. We propose a graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else bei...
متن کاملConditional Preferences: A New Semantics for Database Queries
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preferences are limited when one needs to consider conditional, rather than absolute, preferences (e.g., I prefer driving by car in winter, and by motorbike in summer), which are common in context-aware applications. CP-nets are a...
متن کامل