Mathematical Foundations of Evidence Theory

A Theory of Reasoning with Uncertain Arguments
  • Jürg Kohlas
Chapter

Abstract

Reasoning schemes in artificial intelligence (and elsewhere) use information and knowledge, but the inference my depend on assumptions which are uncertain. In this case arguments in favour of and against hypotheses can be derived. These arguments may be weighed by their likelihoods and thereby the credibility and plausibility of different possible hypotheses can be obtained. This is, in a nutshell, the idea to be explored and developed in this article.

Keywords

Boolean Algebra Outer Probability Support Function Evidence Theory Complete Boolean Algebra 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BESNARD, P.; KOHLAS, J. (1994): Evidence Theory Based on General Consequence Relations. Institute of Informatics, University of Fribourg, Switzerland, Internal Paper No. 94–08. To be published in Int. J. of Foundations of Computer Science.Google Scholar
  2. BIRKHOFF, G. (1948): Lattice Theory. Amer. Math. Soc., New York.Google Scholar
  3. DE KLEER, J. (1986): An Assumption-Based TMS. Art. Int. 28, 127–162.CrossRefGoogle Scholar
  4. DEMPSTER, A. (1967): Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat., 38, 325–339.MathSciNetMATHCrossRefGoogle Scholar
  5. HALMOS, P. (1963): Lectures on Boolean Algebras. Van Nostrand-Reinhold, London.MATHGoogle Scholar
  6. HESTIR, K.; NGUYEN, H.T.; ROGERS, G.S. (1991): A Random Set Formalism for Evidential Reasoning. In GOODMAN, I.R. et al. (eds.): Conditional Logic in Expert Systems, 309–344.Google Scholar
  7. KOHLAS, J. (1991): The Reliability of Reasoning with Unreliable Arguments. Ann. of Op. Res. 32, 76–113.MathSciNetGoogle Scholar
  8. KOHLAS, J. (1993 a): Symbolic Evidence, Arguments, Supports and Valuation Networks. In: CLARKE, M.; KRUSE, R.; MORAL, S.: Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Springer, 186–198.Google Scholar
  9. KOHLAS, J. (1993 b): Support-and Plausibility Functions Induced by Filter-Valued Mappings. Int J. Gen Sys. 21, 343–363.Google Scholar
  10. KOHLAS, J.; MONNEY, P.A. (1993): Probabilistic Assumption-Based Reasoning. In: HECKERMAN, D.; MAMDANI, A.: Uncertainty in Art. Int. Proc. of the Ninth Conf., 485–490.Google Scholar
  11. NEVEU, J. (1964): Bases Mathématiques du Calcul des Probabilités. Masson, Paris.MATHGoogle Scholar
  12. NGUYEN, H.T. (1978): On Random Sets and Belief Functions. J. Math. Anal. and Appl. 65, 531–542.MATHGoogle Scholar
  13. LASKEY, K.B.; LEHNER, P.E. (1989): Assumptions, Beliefs and Probabilities. Art. Int. 41, 65–77.MathSciNetCrossRefGoogle Scholar
  14. PEARL, J. (1988): Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman, San Mateo, Cal.Google Scholar
  15. PROVAN, G.M. (1990): A Logic-Based Analysis of Dempster-Shafer Theory. Int. J. Approx. Reas. 4, 451–495.MathSciNetMATHCrossRefGoogle Scholar
  16. REITER. R., DE KLEER, J. (1987): Foundations of Assumption-Based Truth Maintenance Systems. Proc. Amer. Assoc. A.I., 183–188.Google Scholar
  17. SHAFER, G. (1976): A Mathematical Theory of Evidence. Princeton University Press, 1976.Google Scholar
  18. SHAFER, G. (1979): Allocations of Probability. Ann. of Prob. 7, 827–839.MathSciNetMATHCrossRefGoogle Scholar
  19. WOJCICKI, R. (1988): Theory of Logical Calculi. Basic Theory of Consequence Operations. Kluwer Academic Press, Dordrecht.MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Jürg Kohlas
    • 1
  1. 1.Institute of InformaticsUniversity of FribourgFribourgSwitzerland

Personalised recommendations