Advertisement

On the Exploration of the Query Rewriting Space with Existential Rules

  • Mélanie König
  • Michel Leclère
  • Marie-Laure Mugnier
  • Michaël Thomazo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7994)

Abstract

We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting a conjunctive query (CQ) into a union of CQs. We assume that the set of rules is a finite unification set, i.e., for any CQ, there exists a finite sound and complete rewriting of this CQ with the rules. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator. We define properties of the rewriting operator that ensure the correctness and the termination of this algorithm. Second, we study some operators with respect to the exhibited properties. All these operators have in common to be based on so-called piece-unifiers but they lead to different explorations of the rewriting space. Finally, an experimental comparison of these operators within an implementation of the generic breadth-first rewriting algorithm is presented.

Keywords

Description Logic Conjunctive Query Existential Variable Rule Head Admissible Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BLMS09]
    Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: Extending decidable cases for rules with existential variables. In: IJCAI 2009, pp. 677–682 (2009)Google Scholar
  2. [BLMS11]
    Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artificial Intelligence 175(9-10), 1620–1654 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [CGK08]
    Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: KR 2008, pp. 70–80 (2008)Google Scholar
  4. [CGL+07]
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)CrossRefzbMATHGoogle Scholar
  5. [CGL09]
    Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: PODS 2009, pp. 77–86 (2009)Google Scholar
  6. [CGP10]
    Calì, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in datalog+/-. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 1–17. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. [GOP11]
    Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: ICDE 2011, pp. 2–13 (2011)Google Scholar
  8. [ISG12]
    Imprialou, M., Stoilos, G., Grau, B.C.: Benchmarking ontology-based query rewriting systems. In: AAAI (2012)Google Scholar
  9. [KLMT12]
    König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: A sound and complete backward chaining algorithm for existential rules. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 122–138. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  10. [KLMT13]
    König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: On the Exploration of the Query Rewriting Space with Existential Rules. Technical Report RR-13016, LIRMM, GraphIK - INRIA Sophia Antipolis (April 2013)Google Scholar
  11. [KLT+11]
    Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The Combined Approach to Ontology-Based Data Access. In: IJCAI, pp. 2656–2661 (2011)Google Scholar
  12. [KR11]
    Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI 2011, pp. 963–968 (2011)Google Scholar
  13. [LTW09]
    Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic el using a relational database system. In: IJCAI 2009, pp. 2070–2075 (2009)Google Scholar
  14. [PUHM09]
    Pérez-Urbina, H., Horrocks, I., Motik, B.: Efficient query answering for owl 2. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 489–504. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. [RA10]
    Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: KR 2010 (2010)Google Scholar
  16. [RMC12]
    Rodriguez-Muro, M., Calvanese, D.: High performance query answering over DL-lite ontologies. In: KR (2012)Google Scholar
  17. [SM96]
    Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainings of Graph Rules. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS (LNAI), vol. 1115, pp. 248–262. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  18. [Tho13]
    Thomazo, M.: Compact rewriting for existential rules. In: IJCAI (2013)Google Scholar
  19. [VSS12]
    Venetis, T., Stoilos, G., Stamou, G.B.: Incremental query rewriting for OWL 2 QL. In: Description Logics (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mélanie König
    • 1
  • Michel Leclère
    • 1
  • Marie-Laure Mugnier
    • 1
  • Michaël Thomazo
    • 1
  1. 1.University Montpellier 2France

Personalised recommendations