DFKI Technical Memo-91-13
by Knut Hinkelmann
Forward Logic Evaluation: Developing a Compiler from a Partially Evaluated Meta Interpreter
Pure horn logic does not prescribe any inference strategy. Clauses could be applied in forward and backward direction. This paper presents a translation of rules into forward clauses which simulate a forward chaining deduction if executed by Prolog� resolution procedure. Premises of forward rules are verified by Prolog� backward proof procedure using the original clauses. Thus, without any changes to the Prolog interpreter integrated bidirectional reasoning of horn rules is possible. The translation is obtained from a meta interpreter for forward reasoning written in horn logic. Data-driven partial evaluation of this meta interpreter wrt the original horn clauses results in a forward program. The approach is applied to the problem of recognizing production-specific features from a product model. A product model contains geometrical, topological, and technological information collected during the design phase. From these data features giving valuable hints about manufacturing are derived.
This document is available as PDF-File(15,1MB).
The next abstract is here, and the previous abstract is here.
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.