Abstract
The Dempster-Shafer theory of evidence is developed in a very general setting. Its algebraic part is discussed as a body of arguments which contains an allocation of support and an allowment of possibility for each hypothesis. A rule of combination of bodies of arguments is defined which constitutes the symbolic counterpart of Dempster's rule. Bodies of evidence are introduced by assigning probabilities to arguments. This leads to support and plausibility functions on hypotheses, which constitute the numerical part of evidence theory. Combination of evidence based on the combination of bodies of arguments is discussed and Dempster's rule is derived.
Research supported by the Swiss National Foundation for Research, grant nr. 21-32660.91 and the Swiss Federal Office for Science and Education, Esprit BRA DRUMS2, Defeasible Reasoning and Uncertainty Management
Preview
Unable to display preview. Download preview PDF.
References
Dempster, A.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38 (1967) 325–339
Halmos, P.R.: Lectures on Boolean Algebras. Van Nostrand, Princeton, N.J. (1963)
Hestir, K., Nguyen, H.T., Rogers, G.S.: A Random Set Formalism for Evidential Reasoning. In: Goodman, I.R. et al. (eds.) (1991) 309–344
Kohlas, J.: The Reliability of Reasoning with Unreliable Arguments. Ann. of Op. Res. 32 (1991) 67–113
Kohlas, J.: Support-and Plausibility Functions Induced by Filter — Valued Mappings. Int. J. Gen. Syst. 21, (1993a) 343–363
Kohlas, J. (1993b): Symbolic Evidence, Arguments, Supports, and Valuation Networks. In: Clarke, M., Kruse, R., Moral, S. (eds.): Symbolic and Quantitative Approaches to Reasoning and Uncertainty Springer Berlin (1993b) 186–198
Kohlas, J., Brachinger, H.W.: Mathematical Foundations of Evidence Theory. Institute of Informatics University of Fribourg Internal Working Paper93-06
Kohlas, J.; Monney, P.A.: Probabilistic Assumption-Based Reasoning. In: Heckermann, Mamdani, (eds.): Proc. 9th Conf. on Uncertainty in Artificial Intelligence Kaufmann Morgan Publ. (1993)
Kohlas, J.; Monney P.A.: Representation of Evidence by Hints. In: Yager, R. et al. (eds.): Recent Advances in Dempster-Shafer Theory Wiley New York 473–492
Laskey, K.B.; Lehner, P.E.: Belief Maintenance: An Integrated Approach to Uncertainty Management. Proc. Amer. Ass. for AI (1988) 210–214
Nguyen, H.T.: On Random Sets and Belief Functions. J. Math. Anal. and Appl. 65 (1978) 531–542
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman San Mateo Cal. (1988)
Provan. G.M.: A Logic-Based Analysis of Dempster-Shafer Theory. Int. J. Approx. Res. 4 (1990) 451–495
Shafer. G.: A Mathematical Theory of Evidence. Princeton University Press Princeton N.J. (1976)
Shafer, G.: Allocations of Probability. Ann. of Prob. 7 (1979) 827–839
Sikorski, R.: Boolean Algebras. Springer Berlin (1960)
Smets, P.: Belief functions. In: Smets, P. et al. (eds.): Non-Standard Logics for Automated Reasoning. Academic Press London (1988) 253–286
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kohlas, J., Brachinger, H.W. (1995). Argumentation systems and evidence theory. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Advances in Intelligent Computing — IPMU '94. IPMU 1994. Lecture Notes in Computer Science, vol 945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035935
Download citation
DOI: https://doi.org/10.1007/BFb0035935
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60116-6
Online ISBN: 978-3-540-49443-0
eBook Packages: Springer Book Archive