Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!newsfeed.cit.cornell.edu!newsstand.cit.cornell.edu!news.kei.com!news.mathworks.com!newsfeed.internetmci.com!news.sprintlink.net!news.ecrc.de!ecrc!acrab60!thom
From: thom@ecrc.de (Thom Fruehwirth)
Subject: Re: Concept Languages (was:Re: Paper Availab
Message-ID: <DHB34p.D7A@ecrc.de>
Sender: news@ecrc.de
Reply-To: thom@ecrc.de
Organization: European Computer-Industry Research Centre GmbH.
References: <46nk9m$bm4@news.cs.tu-berlin.de>
Date: Tue, 31 Oct 1995 09:17:13 GMT
Lines: 34

The following paper may be of interest 
(also available at http://www.ecrc.de/staff/thom/)

Technical Report ECRC-94-06
Terminological Reasoning with Constraint Handling Rules
Thom Fruehwirth, ECRC and Philipp Hanschke, DFKI

Terminological knowledge representation formalisms in the tradition of
KL-ONE enable one to define the relevant concepts of a problem domain
and their interaction in a structured and well-formed way.  Recently,
M. Schmidt-Schauss and G. Smolka proposed a new methodology for
constructing sound and complete inference algorithms for
terminological logics.  The consistency test of assertions is the
basis for all terminological reasoning services.  We propose
constraint handling rules (CHRs) as an implementation language for
terminological reasoning.  CHRs are a flexible means to implement
`user-defined' constraints on top of existing host languages like
Prolog and Lisp.

The implementation results in a natural combination of three layers:
(i) a constraint layer that reasons in well-understood domains such as
rationals or finite domains, (ii) a terminological layer providing a
tailored, validated vocabulary on which (iii) the application layer
can rely.  As an application example, a configuration problem is
modeled.  The flexibility of the approach will be illustrated by
extending the formalism, its implementation and the example with
attributes, a new quantifier and concrete domains.



---
thom


