Implementing belief function computations

DOI10.1002/int.10073zbMath1026.68133OpenAlexW2090095227MaRDI QIDQ4406080

Rolf Haenni, Norbert Lehmann

Publication date: 25 June 2003

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.10073

zbMATH Keywords

marginalizationDempster-Shafer belief functionsmass functions

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Resource bounded and anytime approximation of belief function computations. ⋮ Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory ⋮ Maintenance policy performance assessment in presence of imprecision based on Dempster-Shafer theory of evidence ⋮ Effectiveness assessment of cyber-physical systems

Cites Work

• A computationally efficient approximation of Dempster-Shafer theory
• Unnamed Item

This page was built for publication: Implementing belief function computations