Fast-division architecture for Dempster-Shafer belief functions

  • R. Bissig
  • J. Kohlas
  • N. Lehmann
Accepted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1244)


Given a number of Dempster-Shafer belief functions there are different architectures which allow to do a compilation of the given knowledge. These architectures are the Shenoy-Shafer Architecture, the Lauritzen-Spiegelhalter Architecture and the HUGIN Architecture. We propose a new architecture called “Fast-Division Architecture” which is similar to the former two. But there are two important advantages: (i) results of intermediate computations are always valid Dempster-Shafer belief functions and (ii) some operations can often be performed much more efficiently.


Root Node Neighbor Node Mass Function Belief Function Commonality Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Almond, R.G. 1990. Fusion and Propagation of Graphical Belief Models: an Implementation and an Example. Ph.D. thesis, Department of Statistics, Harvard University.Google Scholar
  2. Bissig, R. 1996. Eine schnelle Divisionsarchitektur für Belief-Netwerke. M.Phil. thesis, Institute of Informatics, University of Fribourg.Google Scholar
  3. Dugat, V., & Sandri, S. 1994. Complexity of Hierarchical Trees in Evidence Theory. ORSA Journal on Computing, 6, 37–49.Google Scholar
  4. F.V. Jensen, S.L. Lauritzen, & Olesen, K.G. 1990. Bayesian Updating in Causal Probabilistic Networks by Local Computations. Computational Statistics Quarterly, 4, 269–282.Google Scholar
  5. Kennes, R., & Smets, P. 1990. Computational Aspects of the Möbius Transform. Pages 344–351 of: Proceedings of the 6th Conference on Uncertainty in Artificial Intelligence.Google Scholar
  6. Kohlas, J., & Monney, P.A. 1995. A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence. Lecture Notes in Economics and Mathematical Systems, vol. 425. Springer.Google Scholar
  7. Lauritzen, S.L., & Spiegelhalter, D.J. 1988. Local Computations with Probabil-ities on Graphical Structures and their Application to Expert Systems. J. R. Statist Soc. B, 50(2), 157–224.Google Scholar
  8. Pearl, J. 1986. Fusion, Propagation and Structuring in Belief Networks. Artificial Intelligence, Elsevier Science Publisher B. V. (Amsterdam), 329, 241–288.Google Scholar
  9. Saffiotti, A., & Umkehrer, E. 1991. PULCINELLA: A General Tool for Propa-gating Uncertainty in Valuation Networks. Tech. Rep. IRIDIA, Université de Bruxelles.Google Scholar
  10. Shafer, G. 1976. A Mathematical Theory of Evidence. Princeton University Press.Google Scholar
  11. Shenoy, P.P. 1989. A Valuation-Based Language for Expert Systems. International Journal of Approximate Reasoning, 3, 383–411.Google Scholar
  12. Shenoy, P.P., & Shafer, G. 1990. Axioms for Probability and Belief-Functions Propagation. In: R.D. Shachter, T.S. Levitt, L.N. Kanal (ed), Uncertainty in Artificial Intelligence 4. Elsevier Science Publishers B.V.Google Scholar
  13. Smets, Ph. 1988. Belief Functions. Pages 253–286 of: Ph. Smets, A. Mamdani, D. Dubois, & Prade, H. (eds), Nonstandard logics for automated reasoning. Academic Press.Google Scholar
  14. Thoma, H. Mathis. 1991. Belief Function Computations. Pages 269–307 of: I.R. Goodman, M.M. Gupta, H.T. Nguyen, & Rogers, G.S. (eds), Conditional Logic in Expert Systems. Elsevier Science.Google Scholar
  15. Xu, H., & Kennes, R. 1994. Steps toward efficient implementation of Dempster-Shafer theory. Pages 153–174 of: Yager, R.R., Kacprzyk, J., & Fedrizzi, M. (eds), Advances in the Dempster-Shafer Theory of Evidence. Wiley.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • R. Bissig
    • 1
  • J. Kohlas
    • 1
  • N. Lehmann
    • 1
  1. 1.Institute of InformaticsUniversity of FribourgFribourgSwitzerland

Personalised recommendations