Description Logic Programs: Combining Logic Programs with Description Logic
Top Cited Papers
Preprint
- 1 February 2003
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of first-order logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDF-Schema fragment of Description Logic. We show how to perform DLP-fusion: the bidirectional translation of premises and inferences (including typical kinds of queries) from the DLP fragment of DL to LP, and vice versa from the DLP fragment of LP to DL. In particular, this translation enables one to "build rules on top of ontologies": it enables the rule KR to have access to DL ontological definitions for vocabulary primitives (e.g., predicates and individual constants) used by the rules. Conversely, the DLP-fusion technique likewise enables one to "build ontologies on top of rules": it enables ontological definitions to be supplemented by rules, or imported into DL from rules. It also enables available efficient LP inferencing algorithms/implementations to be exploited for reasoning over large-scale DL ontologies.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- How to Decide Query Containment under Constraints Using a Description LogicPublished by Springer Nature ,2002
- On the Restraining Power of GuardsThe Journal of Symbolic Logic, 1999
- Practical Reasoning for Expressive Description LogicsPublished by Springer Nature ,1999
- On the decidability of query containment under constraintsPublished by Association for Computing Machinery (ACM) ,1998
- The Complexity of Concept LanguagesInformation and Computation, 1997
- On the relative expressiveness of description logics and predicate logicsArtificial Intelligence, 1996
- XSB as an efficient deductive database engineACM SIGMOD Record, 1994
- Logic programming and knowledge representationThe Journal of Logic Programming, 1994
- Magic templates: a spellbinding approach to logic programsThe Journal of Logic Programming, 1991
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984