Representation of Evidence by Hints

  • Jürg Kohlas
  • Paul-André Monney
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 219)

Abstract

This paper introduces a mathematical model of a hint as a body of imprecise and uncertain information. Hints are used to judge hypotheses: the degree to which a hint supports a hypothesis and the degree to which a hypothesis appears as plausible in the light of a hint are defined. This leads in turn to support- and plausibility functions. Those functions are characterized as set functions which are normalized and monotone or alternating of order ∞. This relates the present work to G. Shafer’s mathematical theory of evidence. However, whereas Shafer starts out with an axiomatic definition of belief functions, the notion of a hint is considered here as the basic element of the theory. It is shown that a hint contains more information than is conveyed by its support function alone. Also hints allow for a straightforward and logical derivation of Dempster’s rule for combining independent and dependent bodies of information. This paper presents the mathematical theory of evidence for general, infinite frames of discernment from the point of view of a theory of hints.

Keywords

Hints Evidence Support functions Plausibility functions Dempster’s rule 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. .1
    Choquet G. (1953): Theory of capacities. Ann. Inst. Fourier (Grenoble) 5, 131–295.MathSciNetGoogle Scholar
  2. .2
    Choquet G. (1969): Lectures on analysis. Benjamin, New York.Google Scholar
  3. .3
    Dempster A.P. (1967): Upper and lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics, 38, 325–339.CrossRefMathSciNetGoogle Scholar
  4. .4
    Dubois D., and Prade H. (1986): A Set-Theoretic View of Belief Functions. Logical Operations and Approximations by Fuzzy Sets. Int. J. General Systems, 12, 193–226MathSciNetGoogle Scholar
  5. .5
    Fagin R., and Halpern J.Y. (1989): Uncertainty, Belief, and Probability. IJCAI-89, 1161–1167.Google Scholar
  6. .6
    Goodman I.R., and Nguyen H.T. (1985): Uncertainty Models for Knowledge-Based Systems. North Holland, New York.MATHGoogle Scholar
  7. .7
    Kohlas J. (1990): A Mathematical Theory of Hints. Working Paper, Institute for Automation and Operations Research, University of Fribourg (Switzerland), No. 173.Google Scholar
  8. .8
    Neveu J. (1964): Bases mathématiques du calcul des probabilités. Masson, Paris.MATHGoogle Scholar
  9. .9
    Nguyen H.T. (1978): On Random Sets and Belief Functions. J. Math. Anal. Appl., 65, 531–542.MATHCrossRefMathSciNetGoogle Scholar
  10. .10
    Ruspini E.H. (1987): Epistemic Logics, Probability, and the Calculus of Evidence. IJCAI-87, 924–931.Google Scholar
  11. .11
    Shafer G. (1976): A mathematical theory of evidence. Princeton University Press.Google Scholar
  12. .12
    Shafer G. (1978): Dempster’s rule of combination. Unpublished Manuscript. The University of Kansas, School of Business, 202 Summerfield, Lawrence, Kansas 66045.Google Scholar
  13. .13
    Shafer G. (1979): Allocations of probability. The Annals of Probability, 7, 827–839.MATHCrossRefMathSciNetGoogle Scholar
  14. .14
    Shafer G. (1990): Perspectives on the Theory and Practice of Belief Functions. Int. J. Approx. Reas., 4, 323–362.CrossRefMathSciNetGoogle Scholar
  15. .15
    Strat T. (1984): Continuous Belief Functions for Evidential Reasoning. AAAI-84, 308–313.Google Scholar
  16. .16
    Yager R.R. (1985): The entailment principle for Dempster-Shafer granule. Tech. Report MII-512, Iona college, New Rochelle, N.Y.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jürg Kohlas
  • Paul-André Monney

There are no affiliations available

Personalised recommendations