Skip to main content
SpringerLink
Log in

Theory of evidence — A survey of its mathematical foundations, applications and computational aspects

  • Articles
  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

The mathematical theory of evidence has been introduced by Glenn Shafer in 1976 as a new approach to the representation of uncertainty. This theory can be represented under several distinct but more or less equivalent forms. Probabilistic interpretations of evidence theory have their roots in Arthur Dempster's multivalued mappings of probability spaces. This leads to random set and more generally to random filter models of evidence. In this probabilistic view evidence is seen as more or less probable arguments for certain hypotheses and they can be used to support those hypotheses to certain degrees. These degrees of support are in fact the reliabilities with which the hypotheses can be derived from the evidence. Alternatively, the mathematical theory of evidence can be founded axiomatically on the notion of belief functions or on the allocation of belief masses to subsets of a frame of discernment. These approaches aim to present evidence theory as an extension of probability theory. Evidence theory has been used to represent uncertainty in expert systems, especially in the domain of diagnostics. It can be applied to decision analysis and it gives a new perspective for statistical analysis. Among its further applications are image processing, project planning and scheduling and risk analysis. The computational problems of evidence theory are well understood and even though the problem is complex, efficient methods are available.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Arnborg S, Corneil DG, Proskurowski A (1987) Complexity of Finding Embeddings in ak-Tree,SIAM J. Algebraic and Discrete Methods 8:277–284

    Google Scholar 

  • Almond R (1991) Belief Function Models For Simple Series and Parallel Systems. Tech. Report 207, Department of Statistics, Univ. of Washington

  • Almond R (1992a) Models for Incomplete Failure Data. Statistical Sciences, Inc., Seattle, WA

    Google Scholar 

  • Almond R (1992b) Using the Belief Package. Harvard Univ., Dept. of Statistics

  • Almond R (1992c) Graphical-Belief: Project Overview. Statistical Sciences, Inc., Seattle, WA

    Google Scholar 

  • Almond R, Kong A (1991) Optimality Issues in Constructing Markov Tree froem Graphical Models. Res. Rep. A-3, Harvard Univ., Dept. of Stat

  • Barlow RE, Proschan F (1975)Statistical Theory of Reliability and Life Testing. New York

  • Bertele U, Brioschi F (1972)Nonserial Dynamic Programming. Academic Press

  • Bonissone PP, Henrion M, Kanal LN, Lemmer JF (eds.) (1991)Uncertainty in Artifical Intelligence 6. North Holland, Amsterdam

    Google Scholar 

  • Bouchon-Meunier B, Yager RR, Zadeh LA (eds.) (1991)Uncertainty in Knowledge Bases. Springer Lecture Notes in Computer Science, No. 521

  • Cardona L (1993) Chris: Die Behandlung unzuverlässiger Inferenznetze anhand der Theorie der Hinweise. Diss. Univ. Fribourg, Wirtschafts- und Sozialwiss. Fak

  • Cardona L, Kohlas J, Monney PA (1991) The Reliability of Reasoning with Unreliable Rules and Propositions. In Kruse, Siegel 125–129

  • Cardona L, Kohlas J, Monney PA (1992) Inference with Unreliable Rules, Proc. IPMU'92, 21–24. To appear in the volume of the Lecture Notes in Computer Science series devoted to this conference

  • Choquet G (1953) Theory of Capacities.Ann. Inst. Fourier (Grenoble) 5:131–295

    Google Scholar 

  • D'Ambrosio B, Smets P, Bonissone PP (eds.) (1991)Uncertainty in AI 91. Morgan and Kaufman, San Mateo, Cal

    Google Scholar 

  • De Kleer J (1986) An Assumption-Based TMS.Artifical Intelligence 28:127–162

    Google Scholar 

  • Dempster A (1966) New Methods for Reasoning Towards Posterior Distributions Based on Sample Data.Annals Math. Stat. 37:355–374

    Google Scholar 

  • Dempster A (1967a) Upper and Lower Probabilities Induced by a Multivalued Mapping.Annals Math. Stat. 38:325–339

    Google Scholar 

  • Dempster A (1967b) Upper and Lower Probability Inferences Based on a Sample from a Finite Univariate Population.Biometrika 54:515–528

    Google Scholar 

  • Dempster A (1968a) A Generalization of Bayesian Inference.J. Royal Stat. Soc, Series B, 30:205–247

    Google Scholar 

  • Dempster A (1968b) Upper and Lower Probabilities Generated by a Random Closed Interval.Annals Math. Stat. 39:957–966

    Google Scholar 

  • Dempster A (1990) Bayes, Fisher, and Belief Functions. In: Geisser, S.; Hodges, J.S.; Press, S.J.; Zellner, A. (eds.):Bayesian and Likelihood Methods in Statistics and Econometrics

  • Deutsch-McLeish M (1991) A Model for Non-Monotonie Reasoning Using Dempster's Rule. In Bonissone et al. 481–494

  • Dubois D, Prade H (1982) On Several Representations of an Uncertain Body of Evidence. In Gupta, M.M.; Sanchez, E. (Eds.)Fuzzy Information and Decision Processes. North Holland, Amsterdam, 167–181

    Google Scholar 

  • Dubois D, Prade H (1986) A Set-Theoretic View of Belief Functions.Int. Journal of General Systems 12:193–226

    Google Scholar 

  • Dubois D, Prade H (1985)Théorie des possibilités. Applications à la représentation des connaissances en informatique. Masson, Paris

    Google Scholar 

  • Dubois D, Wellman MP, D'Ambrosio B, Smets P (Eds.) (1992)Uncertainty in AI 92. Morgan and Kaufman, San Mateo, Cal

    Google Scholar 

  • Fagin R, Halpern JY (1989) Uncertainty, Belief, and Probability. IJCAI-89:1161–1167

    Google Scholar 

  • Fagin R, Halpern JY (1991) A New Approach to Updating Beliefs. In Bonissone. et al. (eds.) 347–374

  • Fishburn PC (1970)Utility Theory for Decision Making. Wiley, New York

    Google Scholar 

  • Fraser DAS (1968)The Structure of Inference. Wiley, New York

    Google Scholar 

  • Fedrizzi M, Kacprzyk J, Yager RR (Eds.) (1993)Advances in the Dempster-Shafer Theory of Evidence. Wiley

  • Goodman IR, Nguyen HT (1985)Uncertainty Models for Knowledge-Based Systems. North-Holland, Amsterdam

    Google Scholar 

  • Goodman IR, Gupta MM, Nguyen HT, Rogers GS (1991)Conditional Logic in Expert Systems. North-Holland, Amsterdam

    Google Scholar 

  • Gordon J, Shortliffe EH (1985) A Method for Managing Evidential Reasoning in a Hierarchical Hypothesis Space.Artificial Intelligence 26:323–357

    Google Scholar 

  • Hajek P, Havranek T, Jirousek R (1992)Uncertain Information Processing in Expert Systems. CRC Press, London

    Google Scholar 

  • Halmos P (1969)Lectures on Boolean Algebras. Van Nostrand-Reinhold, London

    Google Scholar 

  • Halpern JY, Fagin R (1992) Two Views of Belief: Belief as Generalized Probability and Belief as Evidence.Artifical Intelligence 54:275–317

    Google Scholar 

  • Henrion M, Shachter RD, Kanal LN, Lemmer JF (eds.) (1990)Uncertainty in Artifical Intelligence 5. North Holland, Amsterdam

    Google Scholar 

  • Hestir K, Nguyen HT, Rogers GS (1991) A Random Set Formalism for Evidential Reasoning. In Goodman, I.R. et al. (eds.) 309–344

  • Hsia Y, Shenoy PP (1989) Mac Evidence: A Visual Evidential Language for Knowledge Based Systems. Working Paper No. 211, Univ. of Kansas, School of Business

  • Inoue K (1992) Linear Resolution for Consequence Finding.Artifical Intelligence 56:301–353

    Google Scholar 

  • Jaffray JY (1989) Linear Utility Theory for Belief Functions.Operations Research Letter 8:107–112

    Google Scholar 

  • Jaffray JY (1992a) Dynamic Decision Making with Belief Functions.Cahiers de Recherche en Economie, Mathématiques et Applications, Univ. de Paris I, No. 92–15

  • Jaffray JY (1992b) Bayesian Updating and Belief Functions.IEEE Trans. SMC 22:1144–1152

    Google Scholar 

  • Jaffray JY, Wakker P (1992) Decision Making with Belief Functions: Compatibility and Incompatibility with the Sure-Thing Principle. Unpubl. Paper, Univ. de Paris VI, LID Paris, France, University of Nijmegen, NICI Nijmegen, The Netherlands

    Google Scholar 

  • Kennes R (1992) Computational Aspects of the Möbius Transform of a Graph.IEEE Trans. SMC 22:201–223

    Google Scholar 

  • Kennes R, Smets P (1991a) Fast Algorithms for Dempster-Shafer Theory. In: Bouchon et al. 14–30

  • Kennes R, Smets P (1991b) Computational Aspects of the Möbius Transform. In. Bonissone et al. 401–416

  • Klawonn F, Smets P (1992) The Dynamic of Belief in the Transferable Belief Model and Specification-Generalization Matrices. In Dubois et al. 130–137

  • Klir GJ, Folger Ta (1988)Fuzzy sets, Uncertainty, and Information. Prentice-Hall.

  • Kohlas J (1987)Zuverlässigkeit und Verfügbarkeit. Teubner, Stuttgart

    Google Scholar 

  • Kohlas J (1989) Modeling Uncertainty with Belief Functions in Numerical Models.European Journal of Operational Research 40:377–388

    Google Scholar 

  • Kohlas J (1990) A Mathematical Theory of Hints. Inst. for Automation and Op. Res., University of Fribourg, Switzerland, Tech. Rep. No. 173 (to appear inInt. J. General Systems under the title: Support and Plausibility Functions Induced by Filter-Valued Mappings).

    Google Scholar 

  • Kohlas J (1991a) The Reliability of Reasoning with Unreliable Arguments.Annals of Operations Research 32:76–113

    Google Scholar 

  • Kohlas J (1991b) Describing Uncertainty in Dynamical Systems by Uncertain Restrictions. Article in: Di Masi G.B. et al. (Eds.)Modeling, Estimation and Control of Systems with Uncertainty. Birkhäuser

  • Kohlas J (1992) Evidential Reasoning About Parametric Models. Inst. for Automation and Op. Res., University of Fribourg, Switzerland, Tech. Rep. No. 194

    Google Scholar 

  • Kohlas J, Monney PA (1991a) Representation of Evidence by Hints. Inst. for Automation and Op. Res., University of Fribourg, Switzerland, Tech. Rep. No. 186 (to be the published in Fedrizzi M. et al. (Eds.)Advances in the Dempster-Shafer Theory of Evidence. Wiley)

    Google Scholar 

  • Kohlas J, Monney PA (1991b) Propagating Belief Functions Through Constraint Systems.Int. J. Approximate Reasoning 5:433–461 (a shorter version is published in Bouchon et al., 1991, 50–57)

    Google Scholar 

  • Kohlas J, Monney PA (1993) Probabilistic Assumption-Based Reasoning. Inst. for Automation and Op. Res., University of Fribourg, Switzerland, Tech. Rep. No. 208

    Google Scholar 

  • Kong A (1986) Multivariate Belief Functions and Graphical Models. Doct. diss. Harvard Univ., Dept. of Stat

  • Kruse R, Schwecke E, Heinsohn J (1991)Uncertainty and Vagueness in Knowledge-Based Systems. Springer

  • Kruse R, Siegel P (eds.) (1991) Symbolic and Quantitative Approaches to Uncertainty. Springer Lecture Notes in Computer Science No. 548

  • Laskey KB, Lehner PE (1988) Belief Maintenance: An Integrated Approach to Uncertainty Management. Proc. Amer. Ass. for AI, 210–214 (reprinted in Shafer, G.; Pearl, J. (eds.). (1990), 694–698)

  • Lauritzen SL, Spiegelhalter DJ (1988) Local Computations with Probabilities on Graphical Structures and their Application to Expert Systems,J. Royal Stat. Soc., Series B, 50:157–224

    Google Scholar 

  • Lohmann G (1991) An Evidential Reasoning Approach to the Classification of Satellite Images. In Kruse, R.; Siegel, P. 227–231

  • Lowrance JD (1988) Automated Argument Construction.J. Stat. Planning Inference 20:369–387

    Google Scholar 

  • Lowrance JD, Garvey TD, Strat TM (1986) A Framework for Evidential Reasoning Systems AAAI-86:869–903

  • Maier D (1983)The Theory of Relational Data Bases. Computer Science Press

  • Matheron G (1975)Random Sets and Integral Geometry. Wiley, New York

    Google Scholar 

  • Mellouli K (1987) On the Propagation of Beliefs in Networks Using the Dempster-Shafer Theory of Evidence. Doct. Diss., Univ. of Kansas, School of Business

  • Monney PA (1991a)Le raisonnement temporel et géométrique sous incertitude. Doctoral Thesis, Math. Institute, Univ. Fribourg, Switzerland

    Google Scholar 

  • Monney PA (1991b) Planar Geometric Reasoning With the Theory of Hints. In Bieri H., Noltemeier H. (Eds.)Computational Geometry. Methods, Algorithms and Applications. Lecture Notes in Computer Science 553:141–159

  • Nguyen HT (1978) On Random Sets and Belief Functions.J. Math. Analysis and Applications 65:531–542

    Google Scholar 

  • Nguyen HT, Smets P (1991) On Dynamics of Cautions Belief and Conditional Objects. Working Paper, TR/IRIDIA/91.13. To appear inInt. J. of Approximate Reasoning

  • Oliver RM, Smith JQ (Eds.) (1990)Influence Diagrams, Belief Nets and Decision Analysis. Wiley

  • Orponen P (1990) Dempster's Rule of Combination is #P-complete.Artificial Intelligence 44: 245–253

    Google Scholar 

  • Pearl J (1988)Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman, San Mateo, Cal

    Google Scholar 

  • Pearl J (1990) Reasoning with Belief Functions: An Analysis of Compatibility.Int. J. Approximate Reasoning 4:363–389

    Google Scholar 

  • Provan GM (1988) Solving Diagnostic Problems Using Extended Truth Maintenance Systems. Proc. European Conf on Art. Int. 547–552

  • Provan GM (1990a) A Logic-Based Analysis of Dempster-Shafer Theory.Int. J. Approximate Reasoning 4:451–495

    Google Scholar 

  • Provan GM (1990b) The Application of Dempster-Shafer Theory to a Logic-Based Visual Recognition System. In Henrion M. et al. 389–405

  • Reiter R (1987) A Theory of Diagnosis from First Principles.Artifical Intelligence 32:57–95

    Google Scholar 

  • Reiter R, de Kleer J (1987) Foundations of Assumption-Based Truth Maintenance Systems. Proc. Amer. Assoc. A.I. 183–188

  • Rose DJ (1970) Triangulated Graphs and the Elimination Process.J. Math. Anal. and Appl. 32:597–609

    Google Scholar 

  • Roy B (1985)Méthodologie Multicritère d'Aide à la Décision. Editions Economica, Paris

    Google Scholar 

  • Ruspini EH (1987) The Logical Foundations of Evidential Reasoning. Tech. Note 408, AI Center, SRI International Menlo Park, Calif

    Google Scholar 

  • Saffiotti A (1991a) Using Dempster-Shafer Theory in Knowledge Representation. In: Bonissone et al. 417–431

  • Saffiotti A (1991b) A Hybrid Belief System for Doubtful Agents. In: Bouchon et al. 393–402

  • Saffiotti A, Umkehrer E (1991) Pulcinella: A General Tool for Propagating Uncertainty in Valuation Networks. Proc. 7-th Conf on Uncertainty in AI, Los Angeles Ca

  • Saffiotti A, Umkehrer E (1992) Automatic Generation of Valuation networks From General Clauses. Proc. IPMU'92, 341–345

  • Schaller JP (1991)Multiple Criteria Decision Aid Under Incomplete Information. Doctoral Thesis, Economic Sciences Faculty, Univ. of Fribourg, Switzerland

    Google Scholar 

  • Shafer G (1976a)A Mathematical Theory of Evidence. Princeton University Press

  • Shafer G (1976b) A Theory of Statistical Evidence. In: Harper, Hooker (eds.): Foundations of Probability Theory, Statistical Inference, and Statistical Theories of Science. Vol. II, Reidel, Dortrecht, 365–463

    Google Scholar 

  • Shafer G (1978) Dempster's Rule of Combination. Unpublished Manuscript

  • Shafer G (1979) Allocations of Probability.Annals of Prob, 7:827–839

    Google Scholar 

  • Shafer G (1982a) Belief Functions and Parametric Models.J. Royal Statist. Soc. B, 44:322–352

    Google Scholar 

  • Shafer G (1982b) Constructive Decision Theory. Univ. of Kansas Dept. of Math. Working Paper

  • Shafer G (1987) Belief Functions and Possibility Measures. In Bezdek (ed.): Analysis of Fuzzy Information, vol I: Mathematics and Logic, CRC Press, Boca Raton, 51–84

    Google Scholar 

  • Shafer G (1990) Perspectives on the Theory and Practice of Belief Functions.Int. J. Approximate Reasoning 4:323–362

    Google Scholar 

  • Shafer G (1991) An Axiomatic Study of Computations in Hypertrees. Working Paper 232, Business School, Univ. of Kansas

  • Shafer G (1992) Rejoinders to Comments on “Perspectives on the Theory and Practice of Belief Functions”.Int. J. Approximate Reasoning 6:445–480

    Google Scholar 

  • Shafer G, Logan R (1987) Implementing Dempster's Rule for Hierarchical Evidence.Artificial Intelligence 33:271–289

    Google Scholar 

  • Shafer G, Pearl J (eds.) (1990)Readings in Uncertain Reasoning. Morgan-Kaufman Publ. San Mateo, Cal

    Google Scholar 

  • Shafer G, Shenoy PP, Mellouli K (1987) Propagating Belief Functions in Qualitative Markov Trees.Int. J. Approximate Reasoning 1:349–400

    Google Scholar 

  • Shafer G, Srivastava RP (1990) The Bayesian and Belief Function Formalisms: A General Perspective for Auditing, Auditing.J. Pract. Theory, 9 (Suppl.)

  • Shenoy PP, Shafer G (1990) Axioms for Probability and Belief-Function Propagation. In Shafer, Pearl 575–610

  • Siegel P (1987) Représentation et utilisation de la connaissance en calcul propositionnel. Ph. D. thesis, Univ. de Marseilles II

  • Smets P (1979) Modèle Quantitatif du Diagnostic Médical.Bulletin de l'Académie de Médecine de Belgique 134:330–343

    Google Scholar 

  • Smets P (1981) Medical Diagnosis: Fuzzy Sets and Degrees of Belief.Fuzzy Sets and Systems 5:259–266

    Google Scholar 

  • Smets P (1988) Belief Functions. In Smets, P.; Mamdani, A.; Dubois, D.; Prade, H.:Non-Standard Logics for Automated Reasoning. Academic Press, London, 253–286

    Google Scholar 

  • Smets P (1989) Constructing the Pignistic Probability Function in a Context of Uncertainty. Proc. of the Fifth Workshop on Uncertainty in AI, Windsor, Canada, 319–326. Also in Henrion et al. 29–39

  • Smets P (1990) The Combination of Evidence in the Transferable Belief Model.IEEE Trans. Pattern Anal. and Machine Int. 12:447–458

    Google Scholar 

  • Smets P (1992) The Nature of the Unnormalized Beliefs Encountered in the Transferable Belief Model. In Dubois et al. 292–297

  • Smets P, Hsia YT (1991) Default Reasoning and the Transferable Belief Model. In Bonissone et al. 495–504

  • Smets P, Kennes R (1990) The Transferable Belief Model. IRIDIA Technical Report TR/IRIDIA/90-14.2, Bruxelles

  • Strat TM (1990) Decision Analysis Using Belief Functions.Int. J. Approximate Reasoning 4:391–418

    Google Scholar 

  • Tarjan RE, Yannakakis M (1984) Simple Linear Time Algorithms to Test Chordality of Graphs., Test Ayclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs.SIAM J. Computing 13:566–579

    Google Scholar 

  • Thoma HM (1991) Belief Function Computations. In Goodman, I.R. et a. (eds.) 269–308

  • Vakili (1993) Approximation of Hints. Inst. for Automation and Op. Res., University of Fribourg, Switzerland, Tech. Rep. No. 209

    Google Scholar 

  • von Neumann J, Morgenstern O (1944)Theory of Games and Economic Behavior. Princeton Univ. Press, Princeton, NJ

    Google Scholar 

  • Wasserman LA (1990a) Prior Envelopes Based on Belief Functions.Annals of Stat. 18:454–464

    Google Scholar 

  • Wasserman LA (1990b) Belief Functions and Statistical Inference.Can. J. Stat. 18:183–196

    Google Scholar 

  • Williams PM (1982) Discussion of Shafer (1982a),J. Royal Statist. Soc. B, 44, 342

    Google Scholar 

  • Wesley LP (1986) Evidential Knowledge-Based Computer Vision.Optical Engineering 25:363–379

    Google Scholar 

  • Xu H (1992) An Efficient Tool for Reasoning with Belief Functions. Proc. IPMU'92, 65–68

  • Yager RR (1985) The Entailment Principle for Dempster-Shafer Granule. Tech. Report MII-512, Iona College, New Rochelle, NY

    Google Scholar 

  • Yen J (1989) Gertis: A Dempster-Shafer Approach to Diagnosing Hierarchical Hypotheses.Communications ACM 32:573–585

    Google Scholar 

  • Zarley D, Hsia, YT, Shafer G (1988): Evidential Reasoning Using Delief, Proc. Nat. Conf, A.I., 1988; Reprinted in Shafer, Pearl, 1990, 619–623

  • Zhang L (1988): Studies on Finding Hypertree Covers for Hypergraphs. Working Paper No. 198, Univ. of Kansas, School of Business

Download references

Author information

Authors and Affiliations

  1. Institute for Automation and Operations Research, University of Fribourg, 1700, Fribourg, Switzerland

    Jürg Kohlas & Paul-André Monney

Authors
  1. Jürg Kohlas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul-André Monney
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partly supported by Grants No. 21-30186.90 and 21-32660.91 of the Swiss National Foundation for Scientific Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kohlas, J., Monney, PA. Theory of evidence — A survey of its mathematical foundations, applications and computational aspects. ZOR - Mathematical Methods of Operations Research 39, 35–68 (1994). https://doi.org/10.1007/BF01440734

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01440734

Key words

Search

Navigation