Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
<p>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, w...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Journal article |
| ভাষা: | English |
| প্রকাশিত: |
Association for the Advancement of Artificial Intelligence
2014
|
| বিষয়গুলি: |