Conference item
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
- Abstract:
- We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog—a novel rule-based KR language that extends both datalog and linear disjunctive datalog and for which reasoning is tractable in data complexity. We then explore applications of weakly linear programs to ontology reasoning and propose a tractable extension of OWL 2 RL with disjunctive axioms. Our empirical results suggest that many non-Horn ontologies can be reduced to weakly linear programs and that query answering over such ontologies using a datalog engine is feasible in practice.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
- Publisher:
- Association for Computing Machinery
- Host title:
- Twenty-Eighth AAAI Conference on Artificial Intelligence
- Journal:
- Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence More from this journal
- Volume:
- abs/1404.3141
- Pages:
- 1077-1083
- Publication date:
- 2014-06-21
- ISBN:
- 9781577356783
Terms of use
- Copyright holder:
- Association for the Advancement of Artificial Intelligence
- Copyright date:
- 2014
- Notes:
- Copyright © 2014 Association for the Advancement of Artificial Intelligence. All rights reserved. This paper was presented at the 28th AAAI Conference on Artificial Intelligence, Quebec City, Canada, July 2014. This is the accepted manuscript version of the paper. The final version is available online from the Association for Computing Machinery at: https://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8201
If you are the owner of this record, you can report an update to it here: Report update to this record