Skip to Main content Skip to Navigation

Querying Existential Rule Knowledge Bases: Decidability and Complexity

Swan Rocher 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 : In this thesis we investigate the issue of querying knowledge bases composed of data and general background knowledge, called an ontology. Ontological knowledge can be represented under different formalisms and we consider here a fragment of first-order logic called existential rules (also known as tuple-generating dependencies and Datalog+/-). The fundamental entailment problem at the core of this thesis asks if a conjunctive query is entailed by an existential rule knowledge base. General existential rules are highly expressive, however at the cost of undecidability. Various restrictions on sets of rules have been proposed to regain the decidability of the entailment problem. Our specific contribution is two-fold. First, we propose a new tool that allows to unify and extend most of the known existential rule classes that rely on acyclicity conditions to tame infinite forward chaining, without increasing the complexity of the acyclicity recognition. Second, we study the compatibility of known decidable rule classes with a frequently required modelling construct, namely transitivity of binary relations. We help clarifying the picture of negative and positive results on this question, and provide a technique to safely combine transitivity with one of the simplest, yet useful, decidable rule classes, namely linear rules.
Document type :
Complete list of metadata
Contributor : Swan Rocher Connect in order to contact the contributor
Submitted on : Monday, March 6, 2017 - 2:22:34 PM
Last modification on : Friday, August 5, 2022 - 3:03:00 PM
Long-term archiving on: : Wednesday, June 7, 2017 - 2:01:43 PM


  • HAL Id : tel-01483770, version 1



Swan Rocher. Querying Existential Rule Knowledge Bases: Decidability and Complexity. Artificial Intelligence [cs.AI]. Université de Montpellier, 2016. English. ⟨tel-01483770⟩



Record views


Files downloads