Towards a possibilistic handling of preferences - Archive ouverte HAL Access content directly
Conference Papers Year : 1999

Towards a possibilistic handling of preferences

(1) , (1) , (1)
1

Abstract

The classical way of encoding preferences in decision theory is by means of utility or value functions. However agents are not always able to deliver such a function directly. In this paper, we relate three different ways of specifying preferences, namely by means of a set of particular types of constraints on the utility function, by means of an ordered set of prioritized goals expressed by logical propositions, and by means of an ordered set of subsets of possible choices reaching the same level of satisfaction. These different expression modes can be handled in a weighted logical setting, here the one of possibilistic logic. The aggregation of preferences pertaining to different criteria can then be handled by fusing sets of prioritized goals. Apart from a better expressivity, the benefits of a logical representation of preferences are to put them in a suitable format for reasoning purposes, or for modifying them.
Fichier principal
Vignette du fichier
099.pdf (403.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03299827 , version 1 (06-09-2021)

Identifiers

  • HAL Id : hal-03299827 , version 1

Cite

Salem Benferhat, Didier Dubois, Henri Prade. Towards a possibilistic handling of preferences. 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), International Joint Conferences on Artificial Intelligence, Inc., 1999, Stockholm, Sweden. pp.1370-1375. ⟨hal-03299827⟩
18 View
9 Download

Share

Gmail Facebook Twitter LinkedIn More