Towards Farsighted Dependencies for Existential Rules

Jean-François BagetJean-François Baget, Marie-Laure MugnierMarie-Laure Mugnier, Michaël ThomazoMichaël Thomazo

Jean-François Baget, Marie-Laure Mugnier, Michaël Thomazo
Towards Farsighted Dependencies for Existential Rules
Proceedings of the 5th International Conference on Web Reasoning and Rule Systems (RR 2011), 30-45, 2011. Springer

Details
Bibtex

KurzfassungAbstract
We consider existential rules (also called Tuple-Generating Dependencies or Datalog+/- rules). These rules are particularly well-suited to the timely 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.
Forschungsgruppe:Research Group: Computational LogicComputational Logic

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-23580-1_4.

@inproceedings{BMT2011,
  author    = {Jean-Fran{\c{c}}ois Baget and Marie-Laure Mugnier and
               Micha{\"{e}}l Thomazo},
  title     = {Towards Farsighted Dependencies for Existential Rules},
  booktitle = {Proceedings of the 5th International Conference on Web Reasoning
               and Rule Systems (RR 2011)},
  publisher = {Springer},
  year      = {2011},
  pages     = {30-45},
  doi       = {10.1007/978-3-642-23580-1_4}
}