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...
المؤلفون الرئيسيون: | 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, وآخرون
منشور في: (2014) -
Datalog rewriting techniques for non-Horn ontologies
حسب: Kaminski, M, وآخرون
منشور في: (2014) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
حسب: Cuenca Grau, B, وآخرون
منشور في: (2016) -
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)