Expressing preferences from generic rules and examples - A possibilistic approach without aggregation function

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dubois, D., Kaci, S., & Prade, H. (2005). Expressing preferences from generic rules and examples - A possibilistic approach without aggregation function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3571 LNAI, pp. 293–304). Springer Verlag. https://doi.org/10.1007/11518655_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free