paper-with-me

홈 › Papers

Dempster-Shafer vs. Probabilistic Logic

2013-03-27 · Daniel Hunter

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.

📄 PDF Abstract BibTeX arXiv:1304.2713

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Logical Interpretation of Dempster-Shafer Theory, with Application to Visual Recognition

2013-03-27 · Gregory M. Provan

We formulate Dempster Shafer Belief functions in terms of Propositional Logic using the implicit notion of provability underlying Dempster Shafer Theory. Given a set of propositional clauses, assigning weights to certain…

An Inequality Paradigm for Probabilistic Knowledge

2013-03-27 · Benjamin N. Grosof

We propose an inequality paradigm for probabilistic reasoning based on a logic of upper and lower bounds on conditional probabilities. We investigate a family of probabilistic logics, generalizing the work of Nilsson [14…

What Does a Belief Function Believe In ?

2017-06-08 · Andrzej Matuszewski, Mieczysław A. Kłopotek

The conditioning in the Dempster-Shafer Theory of Evidence has been defined (by Shafer \cite{Shafer:90} as combination of a belief function and of an "event" via Dempster rule. On the other hand Shafer \cite{Shafer:90}…

Mathematical Theory of Evidence Versus Evidence

2018-11-09 · Mieczysław Kłopotek

This paper is concerned with the apparent greatest weakness of the Mathematical Theory of Evidence (MTE) of Shafer \cite{Shafer:76}, which has been strongly criticized by Wasserman \cite{Wasserman:92ijar}. Weaknesses o…

Using Dempster-Shafer Theory in Knowledge Representation

2013-03-27 · Alessandro Saffiotti

In this paper, we suggest marrying Dempster-Shafer (DS) theory with Knowledge Representation (KR). Born out of this marriage is the definition of "Dempster-Shafer Belief Bases", abstract data types representing uncertain…