1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.AI2014
Ontology Module Extraction via Datalog Reasoning
Ana Armas Romero, Mark Kaminski, Bernardo Cuenca Grau +1
Module extraction - the task of computing a (preferably small) fragment M of an ontology T that preserves entailments over a signature S - has found many applications in recent yea…
cs.AI2014
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
Mark Kaminski, Yavor Nenov, Bernardo Cuenca Grau
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 dis…
cs.LO2010★ 1 cited
A Minimal Propositional Type Theory
Mark Kaminski, Gert Smolka
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show t…