Datalog rewriting techniques for non-Horn 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 |
Έκδοση: |
CEUR-WS.org
2014
|
Θέματα: |
Παρόμοια τεκμήρια
-
Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
ανά: 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) -
Incremental update of datalog materialisation : the backward/forward algorithm
ανά: Motik, B, κ.ά.
Έκδοση: (2015) -
Parallel materialisation of datalog programs in centralised, main-memory RDF systems
ανά: Motik, B, κ.ά.
Έκδοση: (2014)