Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
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...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Conference item |
| প্রকাশিত: |
Association for Computing Machinery
2014
|
Search Result 1
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
প্রকাশিত 2014
Conference item
Search Result 2
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
প্রকাশিত 2014
Journal article
Search Result 3
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
প্রকাশিত 2014
Conference item