Advertisement

An Introduction to Ontology-Based Query Answering with Existential Rules

  • Marie-Laure Mugnier
  • Michaël Thomazo
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8714)

Abstract

The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit ontological knowledge, has been acknowledged in the database, knowledge representation and Semantic Web communities. We focus here on the ontology-based data querying problem, which consists in querying data while taking ontological knowledge into account. To tackle this problem, we consider a logical framework based on existential rules, also called Datalog±.

In this course, we introduce fundamental notions on ontology-based query answering with existential rules. We present basic reasoning techniques, explain the relationships with other formalisms such as lightweight description logics, and review decidability results as well as associated algorithms. We end with ongoing research and some challenging issues.

Keywords

Description Logic Horn Clause Conjunctive Query Query Answering Good Assignment 
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. 1.
    Acciarri, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Palmieri, M., Rosati, R.: Quonto: Querying ontologies. In: AAAI, pp. 1670–1671 (2005)Google Scholar
  2. 2.
    Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res (JAIR) 36, 1–69 (2009)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)Google Scholar
  4. 4.
    Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: KR 2004, pp. 407–414. AAAI Press (2004)Google Scholar
  5. 5.
    Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: IJCAI, pp. 364–369 (2005)Google Scholar
  6. 6.
    Acciarri, A., Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Palmieri, M., Rosati, R.: Quonto: Querying ontologies. In: AAAI, pp. 1670–1671 (2005)Google Scholar
  7. 7.
    Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: AAAI (2012)Google Scholar
  8. 8.
    Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: Extending Decidable Cases for Rules with Existential Variables. In: IJCAI, pp. 677–682 (2009)Google Scholar
  9. 9.
    Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On Rules with Existential Variables: Walking the Decidability Line. Artif. Intell. 175(9-10), 1620–1654 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Baget, J.-F., Mugnier, M.-L.: The Complexity of Rules and Constraints. J. Artif. Intell. Res (JAIR) 16, 425–465 (2002)zbMATHGoogle Scholar
  11. 11.
    Baget, J.-F., Mugnier, M.-L., Thomazo, M.: Towards farsighted dependencies for existential rules. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 30–45. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: IJCAI (2013)Google Scholar
  13. 13.
    Beeri, C., Vardi, M.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)Google Scholar
  14. 14.
    Calì, A., Gottlob, G., Kifer, M.: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In: KR, pp. 70–80 (2008)Google Scholar
  15. 15.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Dl-lite: Tractable description logics for ontologies. In: AAAI, pp. 602–607 (2005)Google Scholar
  16. 16.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Calì, A., Gottlob, G., Lukasiewicz, T.: A General Datalog-Based Framework for Tractable Query Answering over Ontologies. In: PODS, pp. 77–86. ACM (2009)Google Scholar
  18. 18.
    Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: AMW (2010)Google Scholar
  19. 19.
    Chandra, A.K., Lewis, H.R., Makowsky, J.A.: Embedded implicational dependencies and their inference problem. In: STOC, pp. 342–354 (1981)Google Scholar
  20. 20.
    Chein, M., Mugnier, M.-L.: Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs, 1st edn. Springer (2009)Google Scholar
  21. 21.
    Chortaras, A., Trivela, D., Stamou, G.: Optimized query rewriting for OWL 2 QL. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 192–206. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  22. 22.
    Eiter, T., Ortiz, M., Simkus, M., Tran, T.-K., Xiao, G.: Query rewriting for horn-shiq plus rules. In: AAAI (2012)Google Scholar
  23. 23.
    Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data Exchange: Semantics and Query Answering. Theor. Comput. Sci. 336(1), 89–124 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Grau, B.C., Horrocks, I., Krötzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity conditions and their application to query answering in description logics. In: KR (2012)Google Scholar
  25. 25.
    Grau, B.C., Horrocks, I., Krötzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity notions for existential rules and their application to query answering in ontologies. J. Artif. Intell. Res (JAIR) 47, 741–808 (2013)MathSciNetzbMATHGoogle Scholar
  26. 26.
    Gottlob, G., Manna, M., Pieris, A.: Combining decidability paradigms for existential rules. TPLP 13(4-5), 877–892 (2013)MathSciNetzbMATHGoogle Scholar
  27. 27.
    Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: ICDE, pp. 2–13 (2011)Google Scholar
  28. 28.
    Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive datalog programs. In: KR (2012)Google Scholar
  29. 29.
    Imprialou, M., Stoilos, G., Grau, B.C.: Benchmarking ontology-based query rewriting systems. In: AAAI (2012)Google Scholar
  30. 30.
    Kikot, S., Kontchakov, R., Podolskii, V.V., Zakharyaschev, M.: Long rewritings, short rewritings. In: Description Logics (2012)Google Scholar
  31. 31.
    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
  32. 32.
    König, M., Leclère, M., Mugnier, M.-L., Thomazo, M.: On the exploration of the query rewriting space with existential rules. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 123–137. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  33. 33.
    Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI, pp. 963–968 (2011)Google Scholar
  34. 34.
    Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103–117. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  35. 35.
    Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Inconsistency handling in datalog+/- ontologies. In: ECAI (2012)Google Scholar
  36. 36.
    Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog; programs. In: KR (2012)Google Scholar
  37. 37.
    Lutz, C., Seylan, İ., Toman, D., Wolter, F.: The combined approach to OBDA: Taming role hierarchies using filters. In: Alani, H., et al. (eds.) ISWC 2013, Part I. LNCS, vol. 8218, pp. 314–330. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  38. 38.
    Lutz, C., Toman, D., Wolter, F.: Conjunctive Query Answering in the Description Logic \(\mathcal{EL}\) Using a Relational Database System. In: IJCAI, pp. 2070–2075 (2009)Google Scholar
  39. 39.
    Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13–22 (2009)Google Scholar
  40. 40.
    Mora, J., Corcho, Ó.: Engineering optimisations in query rewriting for obda. In: I-SEMANTICS, pp. 41–48 (2013)Google Scholar
  41. 41.
    W3C OWL Working Group. OWL 2 Web Ontology Language: Document Overview. W3C Recommendation (2009), http://www.w3.org/TR/owl2-overview/
  42. 42.
    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
  43. 43.
    Rosati, R., Almatelli, A.: Improving query answering over dl-lite ontologies. In: KR (2010)Google Scholar
  44. 44.
    Rodriguez-Muro, M., Calvanese, D.: High performance query answering over DL-lite ontologies. In: KR (2012)Google Scholar
  45. 45.
    Rosati, R.: Prexto: Query rewriting under extensional constraints in DLlite. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol. 7295, pp. 360–374. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  46. 46.
    Salvat, E., Mugnier, M.-L.: Sound and complete forward and backward chainingd of graph rules. In: ICCS, pp. 248–262 (1996)Google Scholar
  47. 47.
    Thomazo, M., Baget, J.-F., Mugnier, M.-L., Rudolph, S.: A generic querying algorithm for greedy sets of existential rules. In: KR (2012)Google Scholar
  48. 48.
    Thomazo, M.: Compact rewriting for existential rules. In: IJCAI (2013)Google Scholar
  49. 49.
    Trivela, D., Stoilos, G., Chortaras, A., Stamou, G.B.: Optimising resolution-based rewriting algorithms for dl ontologies. In: Description Logics, pp. 464–476 (2013)Google Scholar
  50. 50.
    Venetis, T., Stoilos, G., Stamou, G.B.: Incremental query rewriting for OWL 2 QL. In: Description Logics (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Marie-Laure Mugnier
    • 1
  • Michaël Thomazo
    • 2
  1. 1.Université Montpellier 2France
  2. 2.TU DresdenGermany

Personalised recommendations