Expressing preferences from generic rules and examples – a possibilistic approach without aggregation function

Authors:
Didier Dubois;Souhila Kaci;Henri Prade
Affiliations:
I.R.I.T., Toulouse Cedex 4, France;C.R.I.L., Lens Cedex, France;I.R.I.T., Toulouse Cedex 4, France
Venue:
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2005

Citing 6
Cited 1

Towards a Possibilistic Logic Handling of Preferences

Applied Intelligence
A theoretical framework for possibilistic independence in a weakly ordered setting

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Preference formulas in relational queries

ACM Transactions on Database Systems (TODS)
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning

TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Extending CP-nets with stronger conditional preference statements

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research

Ranking alternatives on the basis of generic constraints and examples: a possibilistic approach

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an approach to representing preferences about multifactorial ratings. Instead of defining a scale of values and aggregation operations, we propose to express rationality conditions and other generic properties, as well as preferences between specific instances, by means of constraints restricting a complete pre-ordering among tuples of values. The derivation of a single complete pre-order is based on possibility theory, using the minimal specificity principle. Some hints for revising a given preference ordering when new constraints are required, are given. This approach looks powerful enough to capture many aggregation modes, even some violating co-monotonic independence.