Computing Datalog Rewritings beyond Horn Ontologies

2013/04/04 by Grau, Bernardo Cuenca, Motik, Boris, Stoilos, Giorgos +1
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1304.1402

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. Our procedure necessarily terminates on DL-Lite_bool^H ontologies---an extension of OWL 2 QL with transitive roles and Boolean connectives.

Related

• Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated\n Queries
• Large-scale Ontological Reasoning via Datalog
• DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under\n SPARQL queries
• Computing Horn Rewritings of Description Logics Ontologies
• Datalog Rewritability of Disjunctive Datalog Programs and its\n Applications to Ontology Reasoning