Hybrid Rules with Well-Founded Semantics
Gespeichert in:
| Titel: | Hybrid Rules with Well-Founded Semantics |
|---|---|
| Autoren: | Drabent, Wlodzimierz, Maluszynski, Jan, 1941 |
| Quelle: | Knowledge and Information Systems. 25(1):137-168 |
| Schlagwörter: | Integration of rules and ontologies, Semantic web reasoning, Knowledge representation, Well-founded semantics, Constructive negation, Constraint logic programming, TECHNOLOGY, Information technology, Computer science, TEKNIKVETENSKAP, Informationsteknik, Datavetenskap |
| Beschreibung: | A general framework is proposed for integration of rules and external first-order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive negation for logic programs. Hybrid rules are normal clauses extended with constraints in the bodies; constraints are certain formulae in the language of the external theory. A hybrid program consists of a set of hybrid rules and an external theory. Instances of the framework are obtained by specifying the class of external theories and the class of constraints. An example instance is integration of (non-disjunctive) Datalog with ontologies formalized in description logics. The paper defines a declarative semantics of hybrid programs and a goal-driven formal operational semantics. The latter can be seen as a generalization of SLS-resolution. It provides a basis for hybrid implementations combining Prolog with constraint solvers (such as ontology reasoners). Soundness of the operational semantics is proven. Sufficient conditions for decidability of the declarative semantics and for completeness of the operational semantics are given. |
| Dateibeschreibung: | electronic |
| Zugangs-URL: | https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-63677 https://liu.diva-portal.org/smash/get/diva2:382144/FULLTEXT01.pdf |
| Datenbank: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | A general framework is proposed for integration of rules and external first-order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive negation for logic programs. Hybrid rules are normal clauses extended with constraints in the bodies; constraints are certain formulae in the language of the external theory. A hybrid program consists of a set of hybrid rules and an external theory. Instances of the framework are obtained by specifying the class of external theories and the class of constraints. An example instance is integration of (non-disjunctive) Datalog with ontologies formalized in description logics. The paper defines a declarative semantics of hybrid programs and a goal-driven formal operational semantics. The latter can be seen as a generalization of SLS-resolution. It provides a basis for hybrid implementations combining Prolog with constraint solvers (such as ontology reasoners). Soundness of the operational semantics is proven. Sufficient conditions for decidability of the declarative semantics and for completeness of the operational semantics are given. |
|---|---|
| ISSN: | 02191377 02193116 |
| DOI: | 10.1007/s10115-010-0300-5 |