Add to ORKGAbstract. Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP-nets model. In particular, we show how hard constraints are sufficient to model the optimal outcomes of a possibly cyclic CP-net, and how soft constraints can faithfully approximate the semantics of acyclic conditional preference statements whilst improving the computational efficiency of reasoning about these statements.
In constraint or preference reasoning, a typical task is to com-pute a solution, or an optimal solut...
Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds:...
Soft constraints are a generalization of classical constraints, which allow for the description of p...
Many real life optimization problems are defined in terms of both hard and soft constraints, and qua...
Abstract. We present a novel approach to deal with preferences expressed as a mixture of hard constr...
We review constraint-based approaches to handle preferences. We start by defining the main notions o...
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP...
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP...
AbstractA simple logic of conditional preferences is defined, with a language that allows the compac...
A simple logic of conditional preferences is defined, with a language that allows the compact repres...
A logic of conditional preferences is defined, with a language which allows she compact representati...
Many AI tasks, such as product configuration, decision support, and the construction of autonomous a...
Personalized access to information is an important task in all real-world applications where the use...
Abstract. In this article, we propose a new soft constraint called preference constraint, squaring w...
International audienceComparative preference statements are the basic ingredients of conditional log...
In constraint or preference reasoning, a typical task is to com-pute a solution, or an optimal solut...
Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds:...
Soft constraints are a generalization of classical constraints, which allow for the description of p...
Many real life optimization problems are defined in terms of both hard and soft constraints, and qua...
Abstract. We present a novel approach to deal with preferences expressed as a mixture of hard constr...
We review constraint-based approaches to handle preferences. We start by defining the main notions o...
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP...
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP...
AbstractA simple logic of conditional preferences is defined, with a language that allows the compac...
A simple logic of conditional preferences is defined, with a language that allows the compact repres...
A logic of conditional preferences is defined, with a language which allows she compact representati...
Many AI tasks, such as product configuration, decision support, and the construction of autonomous a...
Personalized access to information is an important task in all real-world applications where the use...
Abstract. In this article, we propose a new soft constraint called preference constraint, squaring w...
International audienceComparative preference statements are the basic ingredients of conditional log...
In constraint or preference reasoning, a typical task is to com-pute a solution, or an optimal solut...
Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds:...
Soft constraints are a generalization of classical constraints, which allow for the description of p...