Preference Reasoning

  title={Preference Reasoning},
  author={Francesca Rossi},
  • F. Rossi
  • Published in CP 1 October 2005
  • Economics, Computer Science
Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name a few. Our ultimate goal is to define and study formalisms that can model problems with both constraints and many kind of preferences, possibly defined by several agents, and to develop tools to solve such problems efficiently. In this paper we briefly report on recent work towards this goal. 
Constraints and Preferences: Modelling Frameworks and Multi-agent settings
The ultimate goal is to define and study formalisms that can model problems with both constraints and many kind of preferences, possibly defined by several agents, and to develop tools to solve such problems efficiently.
Managing Weighted Preferences with Constraints in Interactive Applications
The Weighted CP-nets (WCP-net) graphical model is used to allow the user to express finegrained preferences on the product attributes and their values in a quantitative or a conditional qualitative form.
Data Mining Techniques and Preference Learning in Recommender Systems
This work enhances a web based recommender system by introducing a learning component to learn user preferences and suggests products based on them using data mining techiques including classification, association rules and cluster analysis techniques.
Memetic Algorithms in Planning, Scheduling, and Timetabling
The basic architecture of a MAs is described, and some guidelines to the design of a successful MA for these applications are presented, as well as some reflections on the lessons learned, and the future directions that research could take in this area.
Requirements for QoS-based Web Service Description and Discovery
  • K. Kritikos, D. Plexousakis
  • Computer Science
    31st Annual International Computer Software and Applications Conference (COMPSAC 2007)
  • 2007
The focus of this paper is to analyze the requirements of a semantically rich QoS-based WSDM and to provide SW and constrained- based mechanisms for enriching syntactic QoS -based WS Discovery (WSDi) algorithms.


mCP Nets: Representing and Reasoning with Preferences of Multiple Agents
We introduce mCP nets, an extension of the CP net formalism to model and handle the qualitative and conditional preferences of multiple agents. We give a number of different semantics for reasoning
Possibility Theory for Reasoning About Uncertain Soft Constraints
This paper considers an existing technique to perform an integration with fuzzy preferences and proposes various alternative semantics which allow us to observe both the preference level and the robustness w.r.t. uncertainty of the complete instantiations.
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
This work proposes a framework, based on both CP-nets and soft constraints, that handles both hard andsoft constraints as well as conditional preferences efficiently and uniformly, and shows how soft constraints can faithfully approximate the semantics of conditional preference statements whilst improving the computational complexity.
Aggregating preferences cannot be fair
It is proved that, under certain conditions on the kind of partial orders that are allowed to express the preferences of the agents and of the result, if there are at least two agents and three outcomes to order, no preference aggregation system can be fair.
Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems
This paper defines an interactive framework where it is possible to state preferences both over constraints and over solutions, and proposes a way to build a system with such features by pairing a soft constraint solver and a learning module, which learns preferences over constraints from preferences over solutions.
Controllability of Soft Temporal Constraint Problems
This work develops a dynamic execution algorithm that produces plans under uncertainty that are optimal w.r.t. preference and proves that dealing simultaneously with preferences and uncertainty does not increase the complexity beyond that of the separate cases.
Preference‐Based Constrained Optimization with CP‐Nets
An approach for constrained optimization based on a set of hard constraints and a preference ordering represented using a CP‐network—a graphical model for representing qualitative preference information offers both pragmatic and computational advantages.
Constraint-Based Preferential Optimization
A new algorithm for finding the optimal outcomes of a constrained CP-net which makes use of hard constraint solving and a weighted constraint approach that allows to find good solutions even when optimals do not exist.
Semiring-based constraint satisfaction and optimization
It is shown how this framework can be used to model both old and new constraint solving and optimization schemes, thus allowing one to both formally justify many informally taken choices in existing schemes, and to prove that local consistency techniques can beused also in newly defined schemes.