Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
We study the problem of rewriting a Disjunctive Datalog program into an equivalent plain Datalog program (i.e., one that entails the same facts for every dataset). We show that a Disjunctive Datalog program is Datalog rewritable if and only if it can be rewritten into a linear program (i.e., having...
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Journal article |
| منشور في: |
Elsevier
2016
|