Allocation of Arguments and Evidence Theory

Abstract The Dempster-Shafer theory of evidence is developed here in a very general setting. First, its symbolic or algebraic part is discussed as a body of arguments which contains an allocation of support and an allowment of possibility for each hypothesis. It is shown how such bodies of arguments arise in the theory of hints and in assumption-based reasoning in logic. A rule of combination of bodies of arguments is then defined which constitutes the symbolic counterpart of Dempster's rule. Bodies of evidence are next introduced by assigning probabilities to arguments. This leads to support and plausibility functions on some measurable hypotheses. As expected in Dempster-Shafer theory, they are shown to be set functions, monotone or alternating of infinite order, respectively. It is shown how these support and plausibility functions can be extended to all hypotheses. This constitutes then the numerical part of evidence theory. Finally, combination of evidence based on the combination of bodies of arguments is discussed and a generalized version of Dempster's rule is derived. The approach to evidence theory proposed is general and is not limited to finite frames.

[1]  J. Kohlas,et al.  A Mathematical Theory of Hints: An Approach to the Dempster-Shafer Theory of Evidence , 1995 .

[2]  J. Neveu.  Bases mathématiques du calcul des probabilités , 1966 .

[3]  Jürg Kohlas.  The reliability of reasoning with unreliable arguments , 1991, Ann. Oper. Res..

[4]  R. Goodstein.  Boolean algebra , 1963 .

[5]  Didier Dubois,et al.  Mathematical models for handling partial knowledge in artificial intelligence , 1995 .

[6]  Madan M. Gupta,et al.  Conditional Logic in Expert Systems , 1991 .

[7]  Gregory M. Provan,et al.  A logic-based analysis of Dempster-Shafer theory , 1990, Int. J. Approx. Reason..

[8]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[9]  Jürg Kohlas.  Symbolic Evidence, Arguments, Supports and Valuation Networks , 1993, ECSQARU.

[10]  Jürg Kohlas.  SUPPORT- AND PLAUSIBILITY FUNCTIONS INDUCED BY FILTER-VALUED MAPPINGS , 1993 .

[11]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[12]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[13]  Adnan Darwiche.  Argument Calculus and Networks , 1993, UAI.

[14]  Hung T. Nguyen,et al.  On Random Sets and Belief Functions , 1978, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[15]  Jürg Kohlas,et al.  Probabilistic Assumption-Based Reasoning , 1993, UAI.

[16]  Kathryn B. Laskey,et al.  Belief Maintenance: An Integrated Approach to Uncertainty Management , 1988, AAAI.

[17]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[18]  Prakash P. Shenoy,et al.  Axioms for probability and belief-function proagation , 1990, UAI.

[19]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[20]  P. Halmos.  Lectures on Boolean Algebras , 1963 .

[21]  Philippe Besnard,et al.  Evidence Theory Based on General Consequence Relations , 1995, Int. J. Found. Comput. Sci..

[22]  Christine Froidevaux,et al.  Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1995 .

[23]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[24]  Jürg Kohlas.  Mathematical Foundations of Evidence Theory , 1995 .