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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00618329
Contributor : Marie-Laure Mugnier <>
Submitted on : Thursday, September 1, 2011 - 2:30:31 PM
Last modification on : Wednesday, December 12, 2018 - 2:38:02 PM
Long-term archiving on : Tuesday, November 13, 2012 - 9:43:15 AM

File

RR2011FinalVersion.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-François Baget, Marie-Laure Mugnier, Michaël Thomazo. Towards Farsighted Dependencies for Existential Rules. RR: Web Reasoning and Rule Systems, Aug 2011, Galway, Ireland. pp.30-45, ⟨10.1007/978-3-642-23580-1_4⟩. ⟨lirmm-00618329⟩

Share

Metrics

Record views

579

Files downloads

473