Computing Datalog Rewritings Beyond Horn Ontologies
Abstract
Rewriting-based approaches for answering queries over an OWL 2 DL ontology have so far been developed mainly for Horn fragments of OWL 2 DL. In this paper, we study the possibilities of answering queries over non-Horn ontologies using datalog rewritings. We prove that this is impossible in general even for very simple ontology languages, and even if PTIME = NP. Furthermore, we present a resolution-based procedure for SHI ontologies that, in case it terminates, produces a datalog rewriting of the ontology. We also show that our procedure necessarily terminates on DL-Lite Bool H,+ ontologies — an extension of OWL 2 QL with transitive roles and Boolean connectives.
Cite
Text
Grau et al. "Computing Datalog Rewritings Beyond Horn Ontologies." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Grau et al. "Computing Datalog Rewritings Beyond Horn Ontologies." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/grau2013ijcai-computing/)BibTeX
@inproceedings{grau2013ijcai-computing,
title = {{Computing Datalog Rewritings Beyond Horn Ontologies}},
author = {Grau, Bernardo Cuenca and Motik, Boris and Stoilos, Giorgos and Horrocks, Ian},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {832-838},
url = {https://mlanthology.org/ijcai/2013/grau2013ijcai-computing/}
}