DFKI Technical Memo-94-03

[Back]

TM-94-03



Language: English

by Victoria Hall

Uncertainty-Valued Horn Clauses

31 Pages

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 returne d 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 funct ion 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.

This document is available as PDF-File(19,7MB).

The next abstract is here, and the previous abstract is here.

DFKI-Bibliothek (bib@dfki.uni-kl.de)

Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.