Skip to main content

Research Summary: Datalog-Based Data Access

  • Conference paper
Web Reasoning and Rule Systems (RR 2012)

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

Included in the following conference series:

  • 688 Accesses

Abstract

This paper presents the research summary of a Ph.D. plan concerning the study of Ontology-Based Data Access (OBDA) for ontologies expressed in Datalog-based formalisms, i.e., Datalog rules that allow the use of existential variables in the head.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  3. 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  MathSciNet  MATH  Google Scholar 

  4. Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American 284(5), 34–43 (2001)

    Article  Google Scholar 

  5. Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of the 28th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2009), pp. 77–86 (2009)

    Google Scholar 

  6. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. Proc. of the VLDB Endowment 3(1), 554–565 (2010)

    Google Scholar 

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

  8. Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Proc. of the 4th Alberto Mendelzon Int. Workshop on Foundations of Data Management (AMW 2010) (2010)

    Google Scholar 

  9. Calì, A., Gottlob, G., Pieris, A.: New expressive languages for ontological query answering. In: Proc. of the 25th AAAI Conf. on Artificial Intelligence (AAAI 2011) (2011)

    Google Scholar 

  10. 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. of Automated Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  11. Ceri, S., Gottlob, G., Tanca, L.: What You Always Wanted to Know About Datalog (And Never Dared to Ask). IEEE Trans. on Knowl. and Data Eng. 1, 146–166 (1989)

    Article  Google Scholar 

  12. Civili, C., Rosati, R.: A broad class of first-order rewritable tuple-generating dependencies. In: Proc. of the 2nd Datalog 2.0 Workshop (to appear, 2012)

    Google Scholar 

  13. Civili, C., Rosati, R.: Query Patterns for Existential Rules. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 42–57. Springer, Heidelberg (2012)

    Google Scholar 

  14. Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: Proc. of the 27th IEEE Int. Conf. on Data Engineering (ICDE 2011), pp. 2–13 (2011)

    Google Scholar 

  15. Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable Datalog ∃  programs. In: Proc. of the 13th Int. Conf. on the Principles of Knowledge Representation and Reasoning, KR 2012 (to appear, 2012)

    Google Scholar 

  16. Patel-Schneider, P.F., Horrocks, I.: Position paper: a comparison of two modelling paradigms in the Semantic Web. In: Proc. of the 15th Int. World Wide Web Conf. (WWW 2006), pp. 3–12 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Civili, C. (2012). Research Summary: Datalog-Based Data Access. In: Krötzsch, M., Straccia, U. (eds) Web Reasoning and Rule Systems. RR 2012. Lecture Notes in Computer Science, vol 7497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33203-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33203-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33202-9

  • Online ISBN: 978-3-642-33203-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics