Abstract
The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 1967; 1968] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 1976], and further publications e.g., [Shafer, 1981; 1990]. More recent variants of Dempster-Shafer theory include the Transferable Belief Model see e.g., [Smets, 1988; Smets and Keimes, 1994] and the Theory of Hints e.g., [Kohlas and Monney, 1995].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
J. A. Barnett. Computations method for a mathematical theory of evidence, in: Proceeding IJCAI-81, Vancouver, BC 868–875, 1891.
M. Bauer. Approximation Algorithms and Decision-Making in the Dempster-Shafer Theory of Evidence—An Empirical Study, International Journal of Approximate Reasoning 17: 217–237, 1997.
R. Bissig, J. Kohlas and N. Lehmann. Fast-Division Architecture for Dempster-Shafer Belief Functions, Proc. ECSQARU-FAPR ‘87, D. Gabbay, R. Kruse, A. Nonnengart, and H. J. Ohlbach (eds.), Springer-Verlag, 198–209, 1997.
A. P. Dempster. Upper and Lower Probabilities Induced by a Multi-valued Mapping. Annals of Mathematical Statistics 38: 325–39, 1967.
A. P. Dempster. A Generalisation of Bayesian Inference (with discussion), J. Royal Statistical Society ser. B 30: 205–247, 1968.
A. P. Dempster and A. Kong. In discussion of G. Shafer, Probability Judgment in Artificial Intelligence and Expert Systems (with discussion) Statistical Science, 2, No.1, 3–44, 1987.
A. P. Dempster and A. Kong. Uncertain Evidence and Artificial Analysis, Journal of Statistical Planning and Inference 20, 355–368, 1988. Also Readings in Uncertain Reasoning, G. Shafer and J. Pearl (eds.), Morgan Kaufmann, San Mateo, California, 1990, 522–528.
D. Dubois and H. Prade. Consonant Approximations of Belief Functions, International Journal of Approximate Reasoning 4: 419–449, 1990.
Fagin and Halpem, 1989] R. Fagin and J. Y. Halpem. Uncertainty, Belief and Probability, Proc
J. A. Bamett. Computational methods for a mathematical theory of evidence, in: Proceedings IICAI-81, Vancouver, BC 868–875, 1981. International Joint Conference on AI (IJCAI-89), 1161–1167, 1989.
W. Feller., An Introduction to Probability Theory and Its Applications, second edition, John Wiley and Sons, New York, London, 1950.
J. Gordon and E. H. Shortliffe. A Method of Managing Evidential Reasoning in a Hierarchical Hypothesis Space, Artificial Intelligence 26, 323–357, 1985.
P. Häjek. Deriving Dempster’s Rule, Proc. IPMU’92, Univ. de Iles Baleares, Mallorca, Spain, 73–75, 1992.
IJAR. Special Issue of Int. J. Approximate Reasoning, 6: 3, May 1992.
J.-Y. Jaffray. Bayesian Updating and Belief Functions, IEEE Trans. SMC, 22: 1144–1152, 1992.
A. V. Joshi, S. C. Sahasrabudhe and K. Shankar. Bayesian Approximation and Invariance of Bayesian Belief Functions, 251–258 of Froidevaux, C., and Kohlas, J., (eds.), Proc. ECSQARU ‘85, Springer Lecture Notes in Artificial Intelligence 946, 1995.
T. Kämpke. About Assessing and Evaluating Uncertain Inferences Within the Theory of Evidence, Decision Support Systems 4, 433–439, 1988.
R. Kennes and R. Smets. Computational Aspects of the Möbius transform, Proc. 6th Conference on Uncertainty in Artificial Intelligence, P. Bonissone, and M. Henrion, (eds.), MIT, Cambridge, Mass., USA, 344–351, 1990.
R. Kennes and R Smets. Proceedings of IPMU Conference, Paris, France, 99–101. Full paper in: Bouchon-Meunier, B., Yager, R. R., Zadeh, L. A., (eds.), Uncertainty in Knowledge Bases„ (1991), 14–23, 1990.
J. Kohlas and P.-A. Monney. A Mathematical Theory of Hints, Springer Lecture Notes in Economics and Mathematical Systems 425, 1995.
A. Kong. Multivariate belief functions and graphical models, PhD dissertation, Dept. Statistics, Harvard University, USA, 1986.
V. Kreinovich, A. Bemat, W. Borrett, Y. Marisca] and E. Villa. Monte-Carlo Methods Make Dempster-Shafer Formalism Feasible, 175–191 of Yager, R., Kacprzyk, J., and Fedrizzi, M., (eds.), Advances in the Dempster-Shafer Theory of Evidence, John Wiley and Sons, 1992.
K. B. Laskey and P. E. Lehner. Assumptions, Beliefs and Probabilities, Artificial Intelligence 41 (1989/90): 65–77, 1989.
N. Lehmann and R. Haenni. An Alternative to Outward Propagation for Dempster-Shafer Belief Functions, Proc. ECSQARU’99, London, UK, July 99, Lecture Notes in Artificial Intelligence 1638, A. Hunter and S. Parsons (eds.), 256–267, 1999.
I. Levi. Consonance, Dissonance and Evidentiary Mechanisms, in Evidentiary value: Philosophical, Judicial and Psychological Aspects of a Theory, P. Gardenfors, B. Hansson and N. E. Sahlin, (eds.) C. W. K. Gleerups, Lund, Sweden, 1983.
S. Moral and A. Salmerdn. A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-computation, Proc. ECSQARU’99, London, UK, July 99, Lecture Notes in Artificial Intelligence 1638, A. Hunter and S. Parsons (eds.), 305–315, 1999.
S. Moral and N. Wilson. Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief, Proceedings of the Twelfth National Conference on Artificial Intelligence, AAAI-94, Seattle, USA, July 31—August 4, 1994, 269–274, 1994.
S. Moral and N. Wilson. Importance Sampling Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief, Proceedings of IPMU’96, Vol. III, 1337–1344, 1996.
P. Orponen. Dempster’s rule is # P-complete, Artificial Intelligence, 44: 245–253, 1990.
J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann Publishers Inc. 1988, Chapter 9, in particular 455–457, 1988.
J. Pearl. Bayesian and Belief-Function Formalisms for Evidential Reasoning: a Conceptual Analysis, Readings in Uncertain Reasoning, G. Shafer and J. Pearl (eds.), Morgan Kaufmann, San Mateo, Califomia, 1990, 540–574, 1990.
Pearl, 1990b1 J. Pearl. Reasoning with Belief Functions: An Analysis of Compatibility, International Journal of Approximate Reasoning, 4 (5/6), 363–390, 1990.
G. Provan. A Logic-based Analysis of Dempster-Shafer Theory, International Journal of Approximate Reasoning, 4, 451–495, 1990.
G. Shafer. A Mathematical Theory of Evidence, Princeton University Press, Princeton, NJ, 1976.
G. Shafer. Constructive Probability, Synthese, 48: 1–60, 1981.
G. Shafer. Lindley’s paradox (with discussion), Journal of the American Statistical Association 7, No. 378, 325–351, 1982.
G. Shafer. Belief Functions and Parametric Models (with discussion), J. Royal Statistical Society ser. B, 44, No. 3, 322–352, 1982.
G. Shafer. Belief Functions and Possibility Measures, Working Paper no.163, School of Business, The University of Kansas, Lawrence, KS, 66045, USA, 1984.
G. Shafer. Perspectives on the Theory and Practice of Belief Functions, International Journal of Approximate Reasoning 4: 323–362, 1990.
G. Shafer. Rejoinders to Comments on “Perspectives on the Theory and Practice of Belief Functions”, International Journal of Approximate Reasoning, 6, No. 3, 445–480, 1992.
Shafer and Logan, 1987] G. Shafer and R. Logan. Implementing Dempster’s Rule for Hierarchical Evidence Artificial Intelligence 33: 271–298, 1987
G. Shafer, P. P. Shenoy and K. Mellouli. Propagating Belief Functions in Qualitative Markov Trees, International Journal of Approximate Reasoning 1: 349–400, 1987.
Shafer and Tversky, 1985] G. Shafer and A. Tversky. Languages and Designs for Probability Judgement Cognitive Science 9: 309–339, 1985
P. P. Shenoy and G. Shafer. Propagating Belief Functions with Local Computations, IEEE Expert, 1 No. 3: 43–52, 1986.
P. P. Shenoy and G. Shafer. Axioms for Probability and Belief Function Propagation, in Uncertainty in Artificial Intelligence 4, R. Shachter, T. Levitt, L. Kanal, J. Lemmer (eds.), North Holland, also in Readings in Uncertain Reasoning, G. Shafer and J. Pearl (eds.), Morgan Kaufmann, San Mateo, Morgan Kaufmann, 1990, 575–610, 1990.
P. Smets. Belief Functions, in Non-standard Logics for Automated Reasoning, P. Smets, E. Mamdami, D. Dubois and H. Prade (eds.), Academic Press, London, 1988.
P. Smets. Constructing the Pignistic Probability Function in a Context of Uncertainty, in Proc. 5th Conference on Uncertainty in Artificial IntelligenceWindsor, 1989
P. Smets. The Combination of Evidence in the Transferable Belief Model, IEEE Trans. Pattern Analysis and Machine Intelligence 12, 447–458, 1990.
P. Smets and R. Kennes. The Transferable Belief Model, Artificial Intelligence 66: 191–234, 1994.
B. Tessera. Approximations for Efficient Computation in the Theory of Evidence, Artificial Intelligence, 61, 315–329, 1993.
H. M. Thoma. Factorization of Belief Functions, Ph.D. Thesis, Department of Statistics, Harvard University, Cambridge, MA, USA, 1989.
H. M. Thoma. Belief Function Computations, 269–308 in Goodman, I.R., Gupta, M.M., Nguyen, H.T., Roger, G.S., (eds.), Conditional Logic in Expert Systems, New York: North-Holland, 1991.
F. Voorbraak. A Computationally Efficient Approximation of Dempster-Shafer Theory, Int. J. Man-Machine Studies, 30, 525–536, 1989.
F. Voorbraak. On the justification of Dempster’s rule of combination, Artificial Intelligence 48: 171–197, 1991.
P. Walley. Statistical Reasoning with Imprecise Probabilities, Chapman and Hall, London, 1991.
L. A. Wasserman. Prior Envelopes Based on Belief Functions, Annals of Statistics 18, No. 1: 454–464, 1990.
N. Wilson. On Increasing the Computational Efficiency of the Dempster-Shafer theory, Research Report no. 11, Dept. of Computing and Mathematical Sciences, Oxford Polytechnic, 1987.
N. Wilson. Justification, Computational Efficiency and Generalisation of the Dempster-Shafer Theory, Research Report no. 15, June 1989, Dept. of Computing and Mathematical Sciences, Oxford Polytechnic, 1989.
N. Wilson. A Monte-Carlo Algorithm for Dempster-Shafer Belief, Proc. 7th Conference on Uncertainty in Artificial Intelligence, B. D’Ambrosio, P. Smets and P. Bonissone (eds.), Morgan Kaufmann, 414–417, 1991.
N. Wilson. How Much Do You Believe?, International Journal of Approximate Reasoning, 6, No. 3, 345–366, 1992.
N. Wilson. The Combination of Belief: When and How Fast, International Journal of Approximate Reasoning, 6, No. 3, 377–388, 1992.
N. Wilson. Some Theoretical Aspects of the Dempster-Shafer Theory, PhD thesis, Oxford Polytechnic, May 1992.
N. Wilson. The Assumptions Behind Dempster’s Rule, Proceedings of the Ninth Conference of Uncertainty in Artificial Intelligence (UAI93), David Heckerman and Abe Mamdani (eds.), Morgan Kaufmann Publishers, San Mateo, California, 527–534, 1993.
N. Wilson. Decision-Making with Belief Functions and Pignistic Probabilities, 2nd European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-93), Kruse, R., Clarke, M. and Moral, S., (eds.), Springer Verlag, 364–371, 1993.
N. Wilson and S. Moral. Fast Markov Chain Algorithms for Calculating Dempster-Shafer Belief, 672–676, Proceedings of the 12th European Conference on Artificial Intelligence, (ECAI-96), Wahlster, W., (ed.), John Wiley and Sons, 1996.
H. Xu. An efficient implementation of the belief function propagation, Proc. 7th Conference on Uncertainty in Artificial Intelligence, B. D’Ambrosio, P. Smets and P. Bonissone (eds.), Morgan Kaufmann, 425–432, 1991.
H. Xu. An efficient tool for reasoning with belief functions, in Bouchon-Meunier, B., Valverde, L. and Yager, R.R., (eds.) Uncertainty in intelligent systems, North Holland, Elsevier Science, 215–224, 1992.
H. Xu. Computing Marginals for Arbitrary Subsets from the Marginal Representation in Markov Trees, Artificial Intelligence 74: 177–189, 1995.
H. Xu and R. Kennes. Steps towards an Efficient Implementation of Dempster-Shafer Theory, in Fedrizzi M., Kacprzyk J, and Yager R. R., (eds.) Advances in the Dempster-Shafer Theory of Evidence, John Wiley & Sons, Inc., 153–174, 1994.
L. A. Zadeh. A Mathematical Theory of Evidence (book review) The AI Magazine 5 No. 3: 81–83, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wilson, N. (2000). Algorithms for Dempster-Shafer Theory. In: Kohlas, J., Moral, S. (eds) Handbook of Defeasible Reasoning and Uncertainty Management Systems. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol 5. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1737-3_10
Download citation
DOI: https://doi.org/10.1007/978-94-017-1737-3_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5603-0
Online ISBN: 978-94-017-1737-3
eBook Packages: Springer Book Archive