Sound, Complete, and Minimal Query Rewriting for Existential Rules

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 in the associated technical report.

[1]  Sebastian Rudolph,et al.  Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.

[2]  Giorgos B. Stamou,et al.  Optimized Query Rewriting for OWL 2 QL , 2011, CADE.

[3]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[4]  Marie-Laure Mugnier,et al.  Sound and Complete Forward and backward Chainingd of Graph Rules , 1996, ICCS.

[5]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[6]  Marie-Laure Mugnier.  Ontological Query Answering with Existential Rules , 2011, RR.

[7]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[8]  Jean-François Baget,et al.  Walking the Decidability Line for Rules with Existential Variables , 2010, KR.

[9]  Giorgos Stoilos,et al.  Benchmarking Ontology-Based Query Rewriting Systems , 2012, AAAI.

[10]  Boris Motik,et al.  Efficient Query Answering for OWL 2 , 2009, SEMWEB.

[11]  Michaël Thomazo,et al.  A Sound and Complete Backward Chaining Algorithm for Existential Rules , 2012, RR.

[12]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[13]  Giorgio Orsi,et al.  Ontological queries: Rewriting and optimization , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[14]  Diego Calvanese,et al.  High Performance Query Answering over DL-Lite Ontologies , 2012, KR.

[15]  Giorgos Stoilos,et al.  Incremental Query Rewriting for OWL 2 QL , 2012, Description Logics.

[16]  Andrea Calì,et al.  A general Datalog-based framework for tractable query answering over ontologies , 2012, J. Web Semant..

[17]  Andrea Calì,et al.  Query Answering under Non-guarded Rules in Datalog+/- , 2010, RR.

[18]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[19]  Sebastian Rudolph,et al.  Extending Decidable Existential Rules by Joining Acyclicity and Guardedness , 2011, IJCAI.