Evidential logic and Dempster-Shafer theory

  • Authors:

  • S S Chen

  • Affiliations:

  • Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC

  • Venue:
  • ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most artificial intelligence applications require reasoning with uncertainty and incompleteness. Such information is not captured in terms of simple true and false values nor in terms of probabilistic estimates when relevant statistical data are lacking. In this paper, we extend Nilsson's probabilistic logic, a semantic generalization of logic, in which the truth value of a sentence is a probability value between Ø and 1 to evidential logic in the framework of Dempster-Shafer theory.