Please use this identifier to cite or link to this item: doi:10.22028/D291-25344
Title: Terminological reasoning with constraint handling rules
Author(s): Hanschke, Philipp
Frühwirth, Thom
Language: English
Year of Publication: 1993
SWD key words: Künstliche Intelligenz
Free key words: artificial intelligence
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: 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 KLONE. 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: (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. 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.
Link to this record: urn:nbn:de:bsz:291-scidok-55005
Series name: Document / Deutsches Forschungszentrum für Künstliche Intelligenz : D [ISSN 0946-0098]
Series volume: 93-01
Date of registration: 13-Sep-2013
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 
D_93_01.pdf7,83 MBAdobe PDFView/Open

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