Can We Enforce Full Compositionality in Uncertainty Calculi?
Abstract
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. 1. Introduction There is a very active research trend in Artificial Intelligence concerning the management of uncertainty in knowledge-based systems. This trend is still influenced by the MYCIN experiments (Buchanan & Shortli...
Cite
Text
Dubois and Prade. "Can We Enforce Full Compositionality in Uncertainty Calculi?." AAAI Conference on Artificial Intelligence, 1994.Markdown
[Dubois and Prade. "Can We Enforce Full Compositionality in Uncertainty Calculi?." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/dubois1994aaai-we/)BibTeX
@inproceedings{dubois1994aaai-we,
title = {{Can We Enforce Full Compositionality in Uncertainty Calculi?}},
author = {Dubois, Didier and Prade, Henri},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1994},
pages = {149-154},
url = {https://mlanthology.org/aaai/1994/dubois1994aaai-we/}
}