Skip to Main content Skip to Navigation

Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms

Michaël Thomazo 1 
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Ontology-based data access (OBDA) aims at enriching query answering by taking general background knowledge into account when evaluating queries. This background knowledge is represented by means of an ontology, that is expressed in this thesis by a very expressive class of first-order formulas, called existential rules (sometimes also tuple-generating dependencies and Datalog+/-). The high expressivity of the used formalism results in the undecidability of query answering, and numerous decidable classes (that is, restrictions on the sets of existential rules) have been proposed in the literature. The contribution of this thesis is two-fold: first, we propose a unified view of a large part of these classes, together with a complexity analysis and a worst-case optimal algorithm for the introduced generic class. Second, we consider the popular approach of query rewriting, and propose a generic algorithm that overcomes trivial causes of combinatorial explosion that make classical approaches inapplicable.
Document type :
Complete list of metadata

Cited literature [75 references]  Display  Hide  Download
Contributor : Thomazo Michaël Connect in order to contact the contributor
Submitted on : Wednesday, January 8, 2014 - 2:45:06 PM
Last modification on : Tuesday, September 6, 2022 - 4:56:02 PM
Long-term archiving on: : Tuesday, April 8, 2014 - 11:16:04 PM


  • HAL Id : tel-00925722, version 1



Michaël Thomazo. Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms. Artificial Intelligence [cs.AI]. Université Montpellier II - Sciences et Techniques du Languedoc, 2013. English. ⟨tel-00925722⟩



Record views


Files downloads