DFKI Document-93-01



Language: English

by Philipp Hanschke, Thom Frühwirth

Terminological Reasoning with Constraint Handling Rules

12 Pages


Constraint handling rules (CHRs) are a flexible means to implement 'user-defined' constraints on top of existing host languages (like Prolog and Lisp).Recently, M. Schmidt-Schauß and G. Smolka proposed a new methodology for constructing sound and complete inference algorithms for terminological knowledge representation formalisms in the tradition of KL-ONE. We propose CHRs as a flexible implementation language for the consistency test of assertions, which is the basis for all terminological reasoning services.

The implementation results in a natural combination of three layers: (1) a constraint layer that reasons in wellunderstood domains such as rationals or finite domains, (2) a terminological layer providing a tailored, validated vocabulary on which (3) the application layer can rely. The flexibility of the approach will be illustrated by extending the formalism, its implementation and an application example (solving configuration problems) with attributes, a new quantifier and concrete domains.

This document is available as Postscript.

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.