Dempster's rule of combination is #P-complete

Artificial Intelligence 44 (1-2):245-253 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

On the justification of Dempster's rule of combination.Frans Voorbraak - 1991 - Artificial Intelligence 48 (2):171-197.
Implementing Dempster's rule for hierarchical evidence.Glenn Shafer & Roger Logan - 1987 - Artificial Intelligence 33 (3):271-298.
The Combination of Different Pieces of Evidence Using Incidence Calculus.Weiru Liu & Alan Bundy - 1992 - Department of Artificial Intelligence, University of Edinburgh.
Limit theorems for Dempster's rule of combination.John Norton - 1988 - Theory and Decision 25 (3):287-313.
Evidential reasoning rule for evidence combination.Jian-Bo Yang & Dong-Ling Xu - 2013 - Artificial Intelligence 205 (C):1-29.
A Mathematical Theory of Evidence.Glenn Shafer - 1976 - Princeton University Press.
Artificial intelligence meets natural stupidity.Drew McDermott - 1981 - In J. Haugel (ed.), Mind Design. MIT Press. pp. 5-18.
Jeffrey's rule of conditioning.Glenn Shafer - 1981 - Philosophy of Science 48 (3):337-362.
A chess combination program which uses plans.Jacques Pitrat - 1977 - Artificial Intelligence 8 (3):275-321.

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,321,788)

6 months
3 (#1,470,638)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Measures of uncertainty in expert systems.Peter Walley - 1996 - Artificial Intelligence 83 (1):1-58.

Add more citations