Computing Symbolic Support Functions by Classical Theorem-Proving Techniques

Urs Hänni ()
Additional contact information
Urs Hänni: University of Fribourg, Institute for Informatics

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

Abstract: Extended Abstract Assumption based reasoning combined with an assignment of probabilities to the assumptions is demonstrated as an implementation of the theory of hints, (Kohlas, Monney, 1993) an extension of Shafer’s mathematical theory of evidence. It is one possibility among others to deal with uncertain knowledge in AI systems. The symbolic representation of uncertain knowledge allows to apply classical inference techniques.

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_17

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

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

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 ().