Skip to main content
SpringerLink
Log in

Ontology Querying: Datalog Strikes Back

  • Chapter
  • First Online:
Reasoning Web. Semantic Interoperability on the Web (Reasoning Web 2017)

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

Included in the following conference series:

  • 964 Accesses

Abstract

In this tutorial we address the problem of ontology querying, that is, the problem of answering queries against a theory constituted by facts (the data) and inference rules (the ontology). A varied landscape of ontology languages exists in the scientific literature, with several degrees of complexity of query processing. We argue that Datalog\(^\pm \), a family of languages derived from Datalog, is a powerful tool for ontology querying. To illustrate the impact of this comeback of Datalog, we present the basic paradigms behind the main Datalog\(^\pm \) as well as some recent extensions. We also present some efficient query processing techniques for some cases.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    Notice that here we deviate from the classic Datalog notation \( head \leftarrow body \) or \( head \texttt {:-} body \); instead, we use the notation \( body \rightarrow head \). Notice also that in Datalog the head is composed of a single atom.

References

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

    MATH  Google Scholar 

  2. Alviano, M., Pieris, A.: Default negation for non-guarded existential rules. In: Proceeding of PODS, pp. 79–90 (2015)

    Google Scholar 

  3. Andréka, H., Németi, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. J. Philos. Logic 27(3), 217–274 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arenas, M., Gottlob, G., Pieris, A.: Expressive languages for querying the semantic web. In: Proceeding of PODS, pp. 14–26 (2014)

    Google Scholar 

  5. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Baumgartner, R., Gatterbauer, W., Gottlob, G.: Monadic datalog and the expressive power of web information extraction languages. In: Liu, L., Tamer Özsu, M. (eds.) Encyclopedia of Database Systems, pp. 3465–3471. Springer, New York (2009)

    Google Scholar 

  8. Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981). doi:10.1007/3-540-10843-2_7

    Chapter  Google Scholar 

  9. Bourhis, P., Morak, M., Pieris, A.: The impact of disjunction on query answering under guarded-based existential rules. In: Proceeding of IJCAI, pp. 796–802 (2013)

    Google Scholar 

  10. Calì, A., Console, M., Frosini, R.: On separability of ontological constraints. In: Proceeding of AMW, pp. 48–61 (2012)

    Google Scholar 

  11. Calì, A., Gottlob, G.: Taming the infinite chase: query answering under expressive relational constraints. J. Artif. Intell. Res. (JAIR) 48, 115–174 (2013)

    MathSciNet  MATH  Google Scholar 

  12. Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Sem. 14, 57–83 (2012)

    Article  Google Scholar 

  13. Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog\(^\pm \): a family of logical knowledge representation and query languages for new applications. In: Proceeding of LICS, pp. 228–242 (2010)

    Google Scholar 

  14. Calì, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: the query answering problem. Artif. Intell. 193, 87–128 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proceeding of PODS, pp. 260–271 (2003)

    Google Scholar 

  16. Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)

    Book  Google Scholar 

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

    Article  Google Scholar 

  18. Furche, T., Gottlob, G., Grasso, G., Gunes, O., Guo, X., Kravchenko, A., Orsi, G., Schallhart, C., Sellers, A., Wang, C.: DIADEM: domain-centric, intelligent, automated data extraction methodology. In: Proceeding of WWW (Companion Volume), pp. 267–270 (2012)

    Google Scholar 

  19. Gottlob, G., Hernich, A., Kupke, C., Lukasiewicz, T.: Stable model semantics for guarded existential rules and description logics. In: Proceeding of KR (2014)

    Google Scholar 

  20. Hajiyev, E., Verbaere, M., Moor, O.: codeQuest: scalable source code queries with datalog. In: Thomas, D. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 2–27. Springer, Heidelberg (2006). doi:10.1007/11785477_2

    Chapter  Google Scholar 

  21. Milani, M., Calì, A., Bertossi, L.E.: A hybrid approach to query answering under expressive Datalog\(^\pm \). In: Proceeding of RR, pp. 144–158 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Systems Birkbeck, University of London, London, UK

    Andrea Calì

  2. Oxford-Man Institute of Quantitative Finance, University of Oxford, Oxford, UK

    Andrea Calì

Authors
  1. Andrea Calì
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Calì .

Editor information

Editors and Affiliations

  1. University of Calabria , Rende, Italy

    Giovambattista Ianni

  2. Sapienza University of Rome , Rome, Italy

    Domenico Lembo

  3. Carleton University , Ottawa, Québec, Canada

    Leopoldo Bertossi

  4. University of Huddersfield , Huddersfield, United Kingdom

    Wolfgang Faber

  5. University of Ulm , Ulm, Germany

    Birte Glimm

  6. St John's College, Oxford, United Kingdom

    Georg Gottlob

  7. University of Koblenz , Koblenz, Germany

    Steffen Staab

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Calì, A. (2017). Ontology Querying: Datalog Strikes Back. In: Ianni, G., et al. Reasoning Web. Semantic Interoperability on the Web. Reasoning Web 2017. Lecture Notes in Computer Science(), vol 10370. Springer, Cham. https://doi.org/10.1007/978-3-319-61033-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61033-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61032-0

  • Online ISBN: 978-3-319-61033-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation