Computing datalog rewritings beyond horn ontologies

Authors:
Bernardo Cuenca Grau;Boris Motik;Giorgos Stoilos;Ian Horrocks
Affiliations:
Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK;School of Electrical and Computer Engineering, National Technical University of Athens, Greece;Department of Computer Science, University of Oxford, UK
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 20
Cited 0

The complexity of Boolean functions

The complexity of Boolean functions
On Datalog vs. polynomial time

Journal of Computer and System Sciences
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Description logic programs: combining logic programs with description logic

WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Reasoning in Description Logics by a Reduction to Disjunctive Datalog

Journal of Automated Reasoning
The Complexity of Conjunctive Query Answering in Expressive Description Logics

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Implementing an Inference Engine for RDFS/OWL Constructs and User-Defined Rules in Oracle

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
QUONTO: querying ontologies

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
Conjunctive query answering for the description logic SHIQ

Journal of Artificial Intelligence Research
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
First order LUB approximations: characterization and algorithms

Artificial Intelligence - Special volume on reformulation
The DL-lite family and relations

Journal of Artificial Intelligence Research
Data complexity in the ƐL family of description logics

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
OWLIM: A family of scalable semantic repositories

Semantic Web
Optimized query rewriting for OWL 2 QL

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Query answering in the horn fragments of the description logics SHOIQ and SROIQ

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

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-LiteboolH,+ ontologies--an extension of OWL 2 QL with transitive roles and Boolean connectives.