Skip to Main content Skip to Navigation

Towards Farsighted Dependencies for Existential Rules

Jean-François Baget 1 Marie-Laure Mugnier 1 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 : We consider existential rules (also called Tuple-Generating Dependencies or Datalog+/- rules). These rules are particularly well-suited to the topical ontological query answering problem, which consists of querying data while taking terminological knowledge into account. Since this problem is not decidable in general, various conditions ensuring decidability have been proposed in the literature. In this paper, we focus on conditions that restrict the way rules may interact to ensure that the forward chaining mechanism is finite. After a review of existing proposals, we propose a generalization of the notion of rule dependency, namely k-dependency, that allows to enlarge halting cases. It can also be used to compile the rule base, which leads to improve query answering algorithms.
Document type :
Complete list of metadata
Contributor : Marie-Laure Mugnier Connect in order to contact the contributor
Submitted on : Monday, May 23, 2011 - 11:41:05 AM
Last modification on : Friday, August 5, 2022 - 3:03:00 PM


  • HAL Id : lirmm-00595033, version 1



Jean-François Baget, Marie-Laure Mugnier, Michaël Thomazo. Towards Farsighted Dependencies for Existential Rules. RR-11016, 2011, pp.16. ⟨lirmm-00595033⟩



Record views