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...
मुख्य लेखकों: | Kaminski, M, Nenov, Y, Cuenca Grau, B |
---|---|
स्वरूप: | Conference item |
प्रकाशित: |
Association for Computing Machinery
2014
|
समान संसाधन
-
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
द्वारा: Kaminski, M, और अन्य
प्रकाशित: (2014) -
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
द्वारा: Kaminski, M, और अन्य
प्रकाशित: (2014) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
द्वारा: Kaminski, M, और अन्य
प्रकाशित: (2014) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
द्वारा: Cuenca Grau, B, और अन्य
प्रकाशित: (2016) -
Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
द्वारा: Kaminski, M, और अन्य
प्रकाशित: (2014)