A Sound and Complete Backward Chaining Algorithm for Existential Rules

@inproceedings{Knig2012ASA,
  title={A Sound and Complete Backward Chaining Algorithm for Existential Rules},
  author={M{\'e}lanie K{\"o}nig and Michel Lecl{\`e}re and Marie-Laure Mugnier and Micha{\"e}l Thomazo},
  booktitle={RR},
  year={2012}
}
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… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

2 Figures & Tables

Topics

Statistics

010202012201320142015201620172018
Citations per Year

54 Citations

Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.