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.
%0 Conference Paper
%1 GrosofHorrocksEtAl03WWW
%A Grosof, Benjamin N.
%A Horrocks, Ian
%A Volz, Raphael
%A Decker, Stefan
%B WWW '03: Proceedings of the 12th International World Wide Web Conference, Budapest, Hungary
%D 2003
%K v1205 acm paper ai knowledge processing rules logic semantic web database zzz.th
%P 48-57
%R 10.1145/775152.775160
%T Description Logic Programs: Combining Logic Programs with Description Logic
%X 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.
%@ 1-58113-680-3
@inproceedings{GrosofHorrocksEtAl03WWW,
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.},
added-at = {2012-05-30T10:46:44.000+0200},
author = {Grosof, Benjamin N. and Horrocks, Ian and Volz, Raphael and Decker, Stefan},
biburl = {https://www.bibsonomy.org/bibtex/277212a5aede8a02dc7f94205b4a75057/flint63},
booktitle = {WWW '03: Proceedings of the 12th International World Wide Web Conference, Budapest, Hungary},
doi = {10.1145/775152.775160},
file = {ACM Digital Library:2000-04/GrosofHorrocksEtAl03WWW.pdf:PDF},
groups = {public},
interhash = {fecc1c40f6c19397936d7bf6c67b56fb},
intrahash = {77212a5aede8a02dc7f94205b4a75057},
isbn = {1-58113-680-3},
keywords = {v1205 acm paper ai knowledge processing rules logic semantic web database zzz.th},
pages = {48-57},
timestamp = {2018-04-16T12:10:44.000+0200},
title = {Description Logic Programs: Combining Logic Programs with Description Logic},
username = {flint63},
year = 2003
}