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 |
---|---|
פורמט: | Conference item |
שפה: | English |
יצא לאור: |
Springer International Publishing
2014
|
נושאים: |
פריטים דומים
-
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
מאת: Kaminski, M, et al.
יצא לאור: (2014) -
Datalog rewriting techniques for non-Horn ontologies
מאת: Kaminski, M, et al.
יצא לאור: (2014) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
מאת: Cuenca Grau, B, et al.
יצא לאור: (2016) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
מאת: Kaminski, M, et al.
יצא לאור: (2014) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
מאת: Kaminski, M, et al.
יצא לאור: (2014)