Abstract
The runtime of the usual algorithms computing the transformation of a basic belief assignment into its associated belief function and conversely is an exponential function of the cardinality of (the domain of) the basic belief assignment. In this paper, new algorithms with a polynomial runtime are presented. These algorithms appear to be optimal in the class of the so-called M-algorithms.
The following text presents some research results of the Belgian National incentive-program for fundamental research in artificial intelligence initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The scientific responsibility is assumed by the authors. These researches have been partially supported by the projects ARCHON and DRUMS which are funded by grants from the Commission of the European Communities under the ESPRIT II-Program, P-2256 and Basic Research Project 3085.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
10. References
Aigner M. (1979), Combinatorial Theory, Springer-Verlag.
Barr M., Wells C. (1990), Category Theory for Computing Science, Prentice Hall.
Kennes R. (1990), Computational Aspects of the Möbius Transformation of a Graph, Technical Report, IRIDIA/90-13, Université Libre de Bruxelles, Brussels, Belgium.
Orponen P. (1990), Dempster's Rule of Combination is #P-complete, Artificial Intelligence, 44, 245–253.
Papadimitriou C. (1979), Optimality of the Fast Fourier Transform, J. ACM 26, 1, 95–102.
Provan G. M. (1990), A Logic-Based Analysis of Dempster-Shafer Theory, International Journal of Approximate Reasoning 4,451–495.
Shafer G. (1976), A Mathematical Theory of Evidence, Princeton University Press.
Smets P. (1988), Belief Functions, In Non Standard Logics for Automated Reasoning, 253–286 (Smets P., Mamdani A., Dubois D. and Prade H. editors), Academic Press.
Thoma H. M. (1989), Factorization of Belief Functions, unpublished Ph.D. thesis, Harvard University, Dept. of Statistics.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kennes, R., Smets, P. (1991). Fast algorithms for Dempster-Shafer theory. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Uncertainty in Knowledge Bases. IPMU 1990. Lecture Notes in Computer Science, vol 521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028102
Download citation
DOI: https://doi.org/10.1007/BFb0028102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54346-6
Online ISBN: 978-3-540-47580-4
eBook Packages: Springer Book Archive