Terminological Reasoning with Constraint Handling Rules
نویسندگان
چکیده
1.1 Abstract Terminological knowledge representation formalisms in the tradition of kl-one enable one to deene the relevant concepts of a problem domain and their interaction in a structured and well-formed way. In recent years, a wealth of literature has appeared on this topic, e.g. Baj93]. Sound and complete inference algorithms for terminological logics have been developed using constraint calculi. These terminological reasoning services can be reduced to a single algorithm checking consistency. We propose constraint handling rules (CHRs) as an implementation language for terminological reasoning. We will give an introduction into the language. CHRs are a exible means to implementùser-deened' constraints on top of existing host languages like Prolog and Lisp. In particular, inference rules, which are often used to deene constraint cal-culi, can usually be written as CHRs with little modiication. The result of using CHRs for terminological reasoning is an incremental and concurrent consistency checking algorithm. The implementation provides a natural combination of three layers: (i) a constraint layer that reasons in well-understood domains such as ra-tionals or nite domains, (ii) a terminological layer providing a tailored, validated vocabulary on which (iii) the application layer can rely. As an application example, a connguration problem is modeled. The exi-bility of the approach will be illustrated by extending the formalism, its implementation and the example with attributes, a new quantiier and concrete domains.
منابع مشابه
Description Logic with Constraint Propagation Rules
The challenges of the Semantic Web endeavour in knowledge representation and reasoning prompted a wealth of research in combining description logic (DL) as ontology languages (e.g. OWL) with logic programming for rule-based reasoning. General issues of combining and integrating formalisms have to be faced such as the type of combination, conceptual simplicity and tractability. Even though const...
متن کاملDescription Logic and Rules the CHR Way Extended Abstract
The challenges of the Semantic Web endeavour in knowledge representation and reasoning prompted a wealth of research in combining description logic (DL) as ontology languages (e.g. OWL) with logic programming for rule-based reasoning. General issues of combining and integrating formalisms have to be faced such as the type of combination, conceptual simplicity and tractability. Even though const...
متن کاملSemantic Query Optimization through Abduction and Constraint Handling
The use of integrity constraints to perform Semantic Query Optimization (SQO) in deductive databases can be formalized in a way similar to the use of integrity constraints in Abductive Logic Programming (ALP) and the use of Constraint Handling Rules in Constraint Logic Programming (CLP). Based on this observation and on the similar role played by, respectively, extensional, abducible and constr...
متن کاملProceedings of CHR 2005, Second Workshop on Constraint Handling Rules
This book contains the Proceedings of CHR 2005, the Second Workshop on Constraint Handling Rules, held at the occasion of ICLP 2005 in Sitges (Spain) on October 5, 2005. The Constraint Handling Rules (CHR) language has become a major declarative specification and implementation language for constraint reasoning algorithms and applications. Algorithms are often specified using inference rules, r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993