Communication Dans Un Congrès Année : 1994

Can we enforce full compositionality in uncertainty calculi ?

Résumé

At AAAI'93, Elkan has claimed to have a result trivializing fuzzy logic. This trivialization is based on too strong a view of equivalence in fuzzy logic and relates to a fully compositional treatment of uncertainty. Such a treatment is shown to be impossible in this paper. We emphasize the distinction between i) degrees of partial truth which are allowed to be truth functional and which pertain to gradual (or fuzzy) propositions, and ii) degrees of uncertainty which cannot be compositional with respect to all the connectives when attached to classical propositions. This distinction is exemplified by the difference between fuzzy logic and possibilistic logic. We also investigate an almost compositional uncertainty calculus, but it is shown to lack expressiveness.

Fichier principal
Vignette du fichier
Can we enforce full compositionality in uncertainty calculi.pdf (165.22 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04054194 , version 1 (03-04-2023)

Licence

Identifiants

  • HAL Id : hal-04054194 , version 1

Citer

Didier Dubois, Henri Prade. Can we enforce full compositionality in uncertainty calculi ?. 12th AAAI National Conference on Artificial Intelligence (AAAI 1994), Association for the Advancement of Artificial Intelligence, Jul 1994, Seattle, WA, United States. pp.149--154. ⟨hal-04054194⟩
70 Consultations
94 Téléchargements

Partager

  • More