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)