Fast algorithms for Dempster-Shafer theory

In B. Bouchon-Meunier, R. R. Yager & L. A. Zadeh (eds.), Uncertainty in Knowledge Bases. Springer. pp. 14--23 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Updating, Undermining, and Independence.Jonathan Weisberg - 2015 - British Journal for the Philosophy of Science 66 (1):121-159.
Limit theorems for Dempster's rule of combination.John Norton - 1988 - Theory and Decision 25 (3):287-313.
The Dempster-Shafer calculus for statisticians.Arthur Dempster - 2008 - International Journal of Approximate Reasoning 48 (2):365--377.
Decision Making with Belief Functions.J. Y. Jaffray - 1994 - In R. Yager, M. Fedrizzi & J. Kacprzyk (eds.), Advances in the Dempster- Shafer Theory of Evidence. John Wiley. pp. 331-352.
Dempster-Shafer theory framed in modal logic.Elena Tsiporkova, Vesilka Boeva & Bernard De Baets - 1999 - International Journal of Approximate Reasoning 21 (2):157--175.
Modal logic interpretation of Dempster-Shafer theory: An infinite case.David Harmanec, George Klir & Zhenyuan Wang - 1996 - International Journal of Approximate Reasoning 14 (2--3):81--93.
The theory of random propositions.John D. Norton - 1994 - Erkenntnis 41 (3):325 - 352.

Analytics

Added to PP
2014-02-02

Downloads
19 (#794,398)

6 months
3 (#962,966)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Robert Kennes
Université Libre de Bruxelles

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references