Expressing Preferences From Generic Rules and Examples -- A Possibilistic Approach Without Aggregation Function

Didier Dubois (1, 2) , Souhila Kaci (3) , Henri Prade (1, 2)

1 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
2 CNRS - Centre National de la Recherche Scientifique
3 CRIL - Centre de Recherche en Informatique de Lens

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.

Mots clés: Preference aggregation; Possibility theory

Domaines: Intelligence artificielle [cs.AI]

Didier Dubois, Souhila Kaci, Henri Prade. Expressing Preferences From Generic Rules and Examples -- A Possibilistic Approach Without Aggregation Function. European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty - ECSQARU 2005, 2005, Barcelone, Spain. pp.293-304, ⟨10.1007/11518655_26⟩. ⟨hal-00014251⟩