Using possibilistic logic for modeling qualitative decision: Atms-based algorithms - Université d'Artois Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 1999

Using possibilistic logic for modeling qualitative decision: Atms-based algorithms

Résumé

This paper describes a logical machinery for computing decisions, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels), and where the preferences of the user are also described by another possibilistic logic base whose formula weights are interpreted in terms of priorities. Two attitudes are allowed for the decision maker: a pessimistic risk-averse one and an optimistic one. The computed decisions are in agreement with a qualitative counterpart to the classical theory of expected utility, recently developed by three of the authors. A link is established between this logical view of qualitative decision making and an ATMS-based computation procedure. Efficient algorithms for computing pessimistic and optimistic optimal decisions are finally given in this logical setting (using some previous work of the fourth author).
Fichier principal
Vignette du fichier
Using possibilistic logic for modeling qualitative decision_Atms-based algorithms.pdf (710.72 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03300799 , version 1 (01-09-2021)

Identifiants

Citer

Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin. Using possibilistic logic for modeling qualitative decision: Atms-based algorithms. Fundamenta Informaticae, 1999, 37 (1-2), pp.1-30. ⟨10.3233/FI-1999-371201⟩. ⟨hal-03300799⟩
62 Consultations
83 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More