Models for Conditional Preferences as extensions of CP-nets
نویسنده
چکیده
This paper presents two frameworks that generalize Conditional Preference networks (CP-nets). The first generalization is the LCP-theory, first order logic theory that provides a rich framework to express preferences. The the second generalization, the PCP-networks, is a probabilistic generalization of CP-nets that models conditional preferences with uncertainty.
منابع مشابه
More-or-Less CP-Networks
Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus (“all else being equal”) assumptions. Despite their intuitive nature and rich representation, dominance testing with CP-nets is computationally complex, even when the CP-nets are restricted to binary-valued pr...
متن کاملMaking CP-Nets (More) Useful
Preferences have been studied in philosophy, economics, psychology, and computer science and have a wide range of applications, such as e-commerce, recommender systems, decision support systems, and control of automated systems. A variety of methods have been proposed for modeling preferences. The one that I consider here is that of conditional preference networks (CP-nets). First studied by Bo...
متن کاملConsistency and Constrained Optimisation for Conditional Preferences
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of conditional preferences can be used to express TCP-net orders, as well as being able to represent much stronger statements of importance than TCP-nets allow. The paper derives various sufficient conditions for a subset of the ...
متن کاملUpdates and Uncertainty in CP-Nets
In this paper we present a two-fold generalization of conditional preference networks (CP-nets) that incorporates uncertainty. CP-nets are a formal tool to model qualitative conditional statements (cp-statements) about preferences over a set of objects. They are inherently static structures, both in their ability to capture dependencies between objects and in their expression of preferences ove...
متن کاملFCP-Nets: extending constrained CP-nets with objective functions
CP-Nets are a framework for dealing with qualitative preferences, both conditional and unconditional. They have received a lot of attention recently, and many extensions have been provided. In particular, the framework of constrained CP-Nets aims to choose, amongst the solutions that satisfy a set of constraints, the preferred one. While the semantics of CP-Nets allows for cycles (and, indeed, ...
متن کامل