Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning

Show other versions (3)

We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose...

תיאור מלא

מידע ביבליוגרפי
Main Authors: Kaminski, M, Nenov, Y, Cuenca Grau, B
פורמט: Conference item
יצא לאור: Association for Computing Machinery 2014
Show all versions (4)

פריטים דומים