Skip to main content
SpringerLink
Log in
Book cover

International Conference on Web Reasoning and Rule Systems

RR 2011: Web Reasoning and Rule Systems pp 2–23Cite as

Ontological Query Answering with Existential Rules

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6902))

Abstract

The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We focus in this paper on the ontological query answering problem, which consists of querying data while taking ontological knowledge into account. To tackle this problem, we consider a logical framework based on existential rules, also called Tuple-Generating Dependencies or Datalog+/- rules. This framework can also be defined in graph terms. Query entailment with existential rules is not decidable, thus a crucial issue is to define decidable classes of rules as large as possible. This paper is a survey of decidable classes of rules, including a review of the main complexity results. It mostly relies on previous work presented at IJCAI’2009 [BLMS09] and KR’2010 [BLM10] (and developed in a journal paper [BLMS11]), updated to include very recent results.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of FOL. Research Report ML-96-03. Univ. of Amsterdam (1996)

    Google Scholar 

  3. Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: KR 2004, pp. 407–414. AAAI Press, Menlo Park (2004)

    Google Scholar 

  4. Baader, F., Brandt, S., Lutz, C.: Pushing the el envelope. In: IJCAI 2005, pp. 364–369 (2005)

    Google Scholar 

  5. Baget, J.-F., Leclère, M., Mugnier, M.-L.: Walking the decidability line for rules with existential variables. In: KR 2010, pp. 466–476. AAAI Press, Menlo Park (2010)

    Google Scholar 

  6. 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 

  7. 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)

    Article  MATH  Google Scholar 

  8. Baget, J.-F., Mugnier, M.-L.: The Complexity of Rules and Constraints. J. Artif. Intell. Res (JAIR) 16, 425–465 (2002)

    MATH  Google Scholar 

  9. Baget, J.-F., Mugnier, M.-L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: IJCAI 2011 ( to appear 2011)

    Google Scholar 

  10. Baget, J.F., Mugnier, M.-L., Thomazo, M.: Towards farsighted dependencies for existential rules. Research report lirmm 11-016 (2011)

    Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Journal of the ACM 31(4), 718–741 (1984)

    Article  MATH  Google Scholar 

  13. 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 

  14. 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)

    Article  MATH  Google Scholar 

  15. 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 

  16. Calì, A., Gottlob, G., Lukasiewicz, T.: Datalog extensions for tractable query answering over ontologies. In: De Virgilio, R., Giunchiglia, F., Tanca, L. (eds.) Semantic Web Information Management: A Model-Based Perspective, pp. 249–279. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In: LICS, pp. 228–242. IEEE Computer Society, Los Alamitos (2010)

    Google Scholar 

  18. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554–565 (2010)

    Google Scholar 

  19. 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)

    Chapter  Google Scholar 

  20. Chandra, A.K., Lewis, H.R., Makowsky, J.A.: Embedded implicational dependencies and their inference problem. In: STOC 1981, pp. 342–354. ACM, New York (1981)

    Google Scholar 

  21. Chein, M., Mugnier, M.-L.: Graph-based Knowledge Representation and Reasoning—Computational Foundations of Conceptual Graphs. In: Advanced Information and Knowledge Processing, Springer, Heidelberg (2009)

    Google Scholar 

  22. Courcelle, B.: The monadic second-order logic of graphs: I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)

    Article  MATH  Google Scholar 

  23. Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies is undecidable. SIAM J. Comput. 14(3), 671–677 (1985)

    Article  MATH  Google Scholar 

  24. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374–425 (2001)

    Article  Google Scholar 

  25. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: PODS 2008, pp. 149–158 (2008)

    Google Scholar 

  26. Deutsch, A., Tannen, V.: Reformulation of xml queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  27. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  28. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)

    Article  MATH  Google Scholar 

  29. Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI 2011(to appear 2011)

    Google Scholar 

  30. Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: AAAI 2007, pp. 452–457. AAAI Press, Menlo Park (2007)

    Google Scholar 

  31. 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 

  32. Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13–22 (2009)

    Google Scholar 

  33. Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification. In: PVLDB, vol. 2(1), pp. 970–981 (2009)

    Google Scholar 

  34. Rudolph, S., Krötzsch, M., Hitzler, P.: All elephants are bigger than all mice. In: Description Logics (2008)

    Google Scholar 

  35. 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)

    Chapter  Google Scholar 

  36. Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading (1984)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Montpellier 2, France

    Marie-Laure Mugnier

Authors
  1. Marie-Laure Mugnier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe Institute of Technology, Institute AIFB, Karlsruhe, 76128, Germany

    Sebastian Rudolph

  2. Computer Science Department, Universidad de Chile, Blanco Enclada, 2120, Santiago, Chile

    Claudio Gutierrez

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mugnier, ML. (2011). Ontological Query Answering with Existential Rules. In: Rudolph, S., Gutierrez, C. (eds) Web Reasoning and Rule Systems. RR 2011. Lecture Notes in Computer Science, vol 6902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23580-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23580-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23579-5

  • Online ISBN: 978-3-642-23580-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation