no code implementations • 28 Apr 2015 • Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Swan Rocher
In this paper, we address the issue of whether transitivity can be safely combined with decidable classes of existential rules.
no code implementations • 15 Dec 2014 • Sebastian Rudolph, Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier
We provide a generic algorithm for query entailment under gbts, which is worst-case optimal for combined complexity with or without bounded predicate arity, as well as for data complexity and query complexity.
no code implementations • 5 May 2014 • Jean-François Baget, Fabien Garreau, Marie-Laure Mugnier, Swan Rocher
Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access.