Dempster's rule for evidence ordered in a complete directed acyclic graph

DOI10.1016/0888-613X(93)90006-YzbMath0785.68085MaRDI QIDQ1308977

Johan Schubert, Ulla Bergsten

Publication date: 17 April 1994

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

partitionsuncertaintycomputational complexityDempster-Shafer theoryevidential reasoningbelief functionsDempster's rulehierarchical networkpropagation of evidencecomplete directed acyclic graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)

Related Items (3)

On \(\rho\) in a decision-theoretic apparatus of Dempster-Shafer theory ⋮ Interval-Valued Degrees of Belief: Applications of Interval Computations to Expert Systems and Intelligent Control ⋮ A realistic (non-associative) logic and a possible explanations of \(7\pm 2\) law

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perspectives on the theory and practice of belief functions
• Implementing Dempster's rule for hierarchical evidence
• Propagating belief functions in qualitative Markov trees
• Rejoinders to comments on Perspectives on the theory and practice of belief functions
• On nonspecific evidence
• A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective

This page was built for publication: Dempster's rule for evidence ordered in a complete directed acyclic graph