**The Logical Foundations Of Evidential Reasoning**

by Ruspini, Enrique H.

Technical Note 408

Institution: AI Center, SRI International

Address: 333 Ravenswood Ave., Menlo Park, CA 94025

Apr 1987.

Note: Originally published December 20, 1986. Revised April 27, 1987.

The approach proposed by Carnap for the development of logical bases for probability theory is investigated by using formal structures that are based on epistemic logics. Epistemic logics are modal logics introduced to deal with issues that are relevant to the state of knowledge that rational agents have about the real world. The use of epistemic logics in problems of analysis of evidence is justified by the need to distinguish among such notions as the state of a real system, the state of knowledge possessed by rational agents, and the impact of information on that knowledge. Carnap’s method for generating a universe of possible worlds is followed using an enhanced notion of possible world that encompasses descriptions of knowledge states. Within such generalized or epistemic universes, several classes of sets are identified in terms of the truth-values of propositions that describe either the state of the world or the state of knowledge about it. These classes of subsets have the structure of a sigma algebra. Probabilities defined over one of these sigma algebras, called the epistemic algebra, are then shown to have the properties of the belief and basic probability assignment functions of the Dempster-Shafer calculus of evidence. It is also shown that any extensions of a probability function defined on the epistemic algebra (representing different states of knowledge) to the truth algebra (representing true states of the real world) must satisfy the interval probability bounds derived from the Dempster-Shafer theory. These bounds are also shown to correspond to the classical notions of lower and upper probability. Furthermore, these constraints are shown to be the best possible bounds, given a specific state of knowledge. Finally, the problem of combining the knowledge that several agents have about a real-world system is addressed. Structures representing possible results of the integration of that knowledge are introduced and a general formula for the combination of evidence is derived. From this formula and certain probabilistic independence assumptions, a generalization of the rule of combination of Dempster is readily proved. The meaning of these independence assumptions is made explicit through the insight provided by the formal structures that are used to represent knowledge and truth. Finally, simple cases of combination of dependent evidence are discussed as an introduction to more general problems of general combination that are examined in a related paper.

Adobe PDF |
BibTeX |
EndNote |

Name | Title | ||
---|---|---|---|

Ruspini, Enrique H | Alumnus |

©2017 SRI International 333 Ravenswood Avenue, Menlo Park, CA 94025-3493

SRI International is an independent, nonprofit corporation. Privacy policy

SRI International is an independent, nonprofit corporation. Privacy policy