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...
Auteurs principaux: | Kaminski, M, Nenov, Y, Grau, BC |
---|---|
Format: | Conference item |
Langue: | English |
Publié: |
CEUR-WS.org
2014
|
Sujets: |
Documents similaires
-
Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
par: Kaminski, M, et autres
Publié: (2014) -
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
par: Kaminski, M, et autres
Publié: (2014) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
par: Cuenca Grau, B, et autres
Publié: (2016) -
Incremental update of datalog materialisation : the backward/forward algorithm
par: Motik, B, et autres
Publié: (2015) -
Parallel materialisation of datalog programs in centralised, main-memory RDF systems
par: Motik, B, et autres
Publié: (2014)