Please use this identifier to cite or link to this item: doi:10.22028/D291-25054
Title: Uncertainty-valued horn clauses
Author(s): Hall, Victoria
Language: English
Year of Publication: 1994
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1994
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: There are many forms of uncertainty, each usually again having more than one theoretical model. Therefore, a very flexible kind of uncertainty-valued Horn clauses is introduced in RELFUN in section 1. They have a head, several premises and an uncertainty factor, which represents the uncertainty of the clause. The premises are all "functional" in the sense that their returned value is again an uncertainty value. These premises and the uncertainty factor of an uncertainty rule become embedded into the arguments of a combination function when translating uncertainty clauses into footed clauses (non-ground, non-deterministic functions in RELFUN, which can then be compiled as usual). The combination function can be modified by the user. It may be a built-in or a user-defined function, either of which may be computed as the value of a higher-order function. In section 2, an application of uncertainty clauses to the uncertain concept of a "pet holder", according to German law, is described. This and another example are then fully demonstrated in appendix A. Finally, appendix B gives a listing of the complete uncertainty translator in LISP.
Link to this record: urn:nbn:de:bsz:291-scidok-38958
Series name: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Series volume: 94-03
Date of registration: 8-Jul-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
TM_94_03.pdf11,97 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.