Towards Farsighted Dependencies for Existential Rules - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports Year : 2011

Towards Farsighted Dependencies for Existential Rules

Jean-François Baget
Michaël Thomazo

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.
No file

Dates and versions

lirmm-00595033 , version 1 (23-05-2011)

Identifiers

  • HAL Id : lirmm-00595033 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More