Can Uncertainty Management Be Realized in a Finite Totally Ordered Probability Algebra?
Abstract
In this paper, the feasibility of using finite totally ordered probability models under Alelinnas's Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general form of the probability algebra of these models is derived and the number of possible algebras with given size is deduced. Based on this analysis, we discuss problems of denominator-indifference and ambiguity-generation that arise in reasoning by cases and abductive reasoning. An example is given that illustrates how these problems arise. The investigation shows that a finite probability model may be of very limited usage.
Cite
Text
Xiang et al. "Can Uncertainty Management Be Realized in a Finite Totally Ordered Probability Algebra?." Conference on Uncertainty in Artificial Intelligence, 1989.Markdown
[Xiang et al. "Can Uncertainty Management Be Realized in a Finite Totally Ordered Probability Algebra?." Conference on Uncertainty in Artificial Intelligence, 1989.](https://mlanthology.org/uai/1989/xiang1989uai-uncertainty/)BibTeX
@inproceedings{xiang1989uai-uncertainty,
title = {{Can Uncertainty Management Be Realized in a Finite Totally Ordered Probability Algebra?}},
author = {Xiang, Yang and Beddoes, Michael P. and Poole, David L},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1989},
url = {https://mlanthology.org/uai/1989/xiang1989uai-uncertainty/}
}