IEEE Transactions on Pattern Analysis and Machine Intelligence · 1991 · 38 citations · 5 references
ComputingComputer ScienceMathematicsKnowledge RepresentationProbability TheoryTheory Of ComputationBayesian InferenceDecision-making Under UncertaintyProbabilistic Machine LearningStatistical InferenceUncertainty RepresentationBelief FunctionsDempster - Shafer TheoryDempster-shafer TheoryEvidence TheoryPossibility Theory
A sufficient condition for the equality of the plausibility and commonality measures of the Dempster-Shafer belief calculus is developed. When the condition is met, an efficient method to calculate relative plausibility is available. In particular, the method can be used to calculate the relative plausibility of atomic hypotheses and, therefore, it can be used to find the choice that maximizes this measure. The computation is efficient enough to make Dempster-Shafer practical in some domains where computational complexity would otherwise discourage its use.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
5
Logic, Semantics, Metamathematics.
L. Jonathan Cohen, Alfred Tarski, J. H. Woodger · The Philosophical Quarterly · 1958 · 802 citations
Humanities, Mathematics, Philosophy +15
Dempster's rule of combination is #P-complete
Pekka Orponen · Artificial Intelligence · 1990 · 107 citations · Full text