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...
Príomhchruthaitheoirí: | Kaminski, M, Nenov, Y, Cuenca Grau, B |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
Association for Computing Machinery
2014
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014) -
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
de réir: Cuenca Grau, B, et al.
Foilsithe / Cruthaithe: (2016) -
Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)