Mathematical Foundations of Evidence Theory

Jürg Kohlas ()
Additional contact information
Jürg Kohlas: University of Fribourg, Institute of Informatics

A chapter in Mathematical Models for Handling Partial Knowledge in Artificial Intelligence, 1995, pp 31-64 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4899-1424-8_3

Ordering information: This item can be ordered from
http://www.springer.com/9781489914248

DOI: 10.1007/978-1-4899-1424-8_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().