Dempster-Shafer vs. Probabilistic Logic

03/27/2013
by   Daniel Hunter, et al.
0

The combination of evidence in Dempster-Shafer theory is compared with the combination of evidence in probabilistic logic. Sufficient conditions are stated for these two methods to agree. It is then shown that these conditions are minimal in the sense that disagreement can occur when any one of them is removed. An example is given in which the traditional assumption of conditional independence of evidence on hypotheses holds and a uniform prior is assumed, but probabilistic logic and Dempster's rule give radically different results for the combination of two evidence events.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

research
04/06/2017

Transferrable Plausibility Model - A Probabilistic Interpretation of Mathematical Theory of Evidence

This paper suggests a new interpretation of the Dempster-Shafer theory i...
research
03/27/2013

Independence and Bayesian Updating Methods

Duda, Hart, and Nilsson have set forth a method for rule-based inference...
research
07/26/2018

A conditional independence framework for coherent modularized inference

Inference in current domains of application are often complex and requir...
research
03/27/2013

A Measure-Free Approach to Conditioning

In an earlier paper, a new theory of measurefree "conditional" objects w...
research
09/28/2020

Uncertain Linear Logic via Fibring of Probabilistic and Fuzzy Logic

Beginning with a simple semantics for propositions, based on counting ob...
research
03/27/2013

On the Combinality of Evidence in the Dempster-Shafer Theory

In the current versions of the Dempster-Shafer theory, the only essentia...
research
09/01/2023

Sherlock Holmes Doesn't Play Dice: The significance of Evidence Theory for the Social and Life Sciences

While Evidence Theory (Demster-Shafer Theory, Belief Functions Theory) i...

Please sign up or login with your details

Forgot password? Click here to reset