A Database Preference Query Model Based on a Fuzzy Outranking Relation

In this paper, we describe an approach to database preference queries based on the notion of fuzzy outranking, suited to the case where partial preferences are incommensurable. This model constitutes an alternative to the use of Pareto order. Even though outranking does not define an order in the strict sense of the term, we describe a technique which yields a complete pre-order, based on a global aggregation of the outranking degrees computed for each pair of tuples.