Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
From MaRDI portal
Publication:3524940
DOI10.1007/978-3-540-75256-1_30zbMATH Open1148.68525OpenAlexW1488991733MaRDI QIDQ3524940FDOQ3524940
Authors: N. Lehmann
Publication date: 16 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_30
Recommendations
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
- Implementing belief function computations
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524940)