Skip to Main content Skip to Navigation
Conference papers

A Sound and Complete Backward Chaining Algorithm for Existential Rules

Mélanie König 1 Michel Leclère 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 address the issue of Ontology-Based Data Access which consists of exploiting the semantics expressed in ontologies while querying data. Ontologies are represented in the framework of existential rules, also known as Datalog+/-. We focus on the backward chaining paradigm, which involves rewriting the query (assumed to be a conjunctive query, CQ) into a set of CQs (seen as a union of CQs). The proposed algorithm accepts any set of existential rules as input and stops for so-called finite unification sets of rules (fus). The rewriting step relies on a graph notion, called a piece, which allows to identify subsets of atoms from the query that must be processed together. We first show that our rewriting method computes a minimal set of CQs when this set is finite, i.e., the set of rules is a fus. We then focus on optimizing the rewriting step. First experiments are reported.
Document type :
Conference papers
Complete list of metadata
Contributor : Mélanie König Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2012 - 6:03:10 PM
Last modification on : Friday, October 22, 2021 - 3:07:24 PM
Long-term archiving on: : Wednesday, March 13, 2013 - 3:57:47 AM


Files produced by the author(s)



Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo. A Sound and Complete Backward Chaining Algorithm for Existential Rules. RR'2012: International Conference on Web Reasoning and Rule Systems, Sep 2012, Vienna, Australia. pp.122-138, ⟨10.1007/978-3-642-33203-6_10⟩. ⟨lirmm-00764341v1⟩



Record views


Files downloads