Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
<p>We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and adm...
Main Authors: | Kaminski, M, Nenov, Y, Grau, BC |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Springer International Publishing
2014
|
Subjects: |
Similar Items
-
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
by: Kaminski, M, et al.
Published: (2014) -
Datalog rewriting techniques for non-Horn ontologies
by: Kaminski, M, et al.
Published: (2014) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
by: Cuenca Grau, B, et al.
Published: (2016) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
by: Kaminski, M, et al.
Published: (2014) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
by: Kaminski, M, et al.
Published: (2014)