Skip to main content
SpringerLink
Log in

Query Rewriting under Linear \(\mathcal {EL}\) Knowledge Bases

  • Conference paper
  • First Online:
Book cover Web Reasoning and Rule Systems (RR 2016)

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

Included in the following conference series:

Abstract

With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering more expressive queries than simple conjunctive queries. In this paper we exploit such capabilities to answer conjunctive queries (CQs) under ontologies expressed in the description logic called linear \(\mathcal {EL}^ {\ell }in \), a restricted form of \(\mathcal {EL}\). In particular, we show a query answering algorithm that rewrites a given CQ into a conjunctive regular path query (CRPQ) which, evaluated on the given instance, returns the correct answer. Our technique is based on the representation of infinite unions of CQs by non-deterministic finite-state automata. Our results achieve optimal data complexity, as well as producing rewritings straightforwardly implementable in SPARQL 1.1.

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

References

  1. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI (2005)

    Google Scholar 

  2. Baader, F., Nutt, W.: Basic description logics. In: Description Logic Handbook. pp. 43–95 (2003)

    Google Scholar 

  3. Baget, J.F., Leclre, M., Mugnier, M.L., Salvat, E.: On rules with existential variables: walking the decidability line. Artif. Intell. 175(9), 1620–1654 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Barcelo, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. TODS 37(4), 31 (2012)

    Article  Google Scholar 

  5. Bienvenu, M., Hansen, P., Lutz, C., Wolter, F.: First order-rewritability and containment of conjunctive queries in horn description logics. In: DLOG (2016)

    Google Scholar 

  6. Bienvenu, M., Lutz, C., Wolter, F.: First-order rewritability of atomic queries in horn description logics. In: IJCAI (2013)

    Google Scholar 

  7. Bienvenu, M., Ortiz, M., Simkus, M.: Conjunctive regular path queries in lightweight description logics. In: IJCAI (2013)

    Google Scholar 

  8. Bourhis, P., Krötzsch, M., Rudolph, S.: Reasonable highly expressive query languages. In: IJCAI (2015)

    Google Scholar 

  9. 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. Reason. 39(3), 385–429 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gottlob, G., Orsi, G., Pieris, A.: ontological queries: rewriting and optimization. In: ICDE (2011)

    Google Scholar 

  11. Hansen, P., Lutz, C., Seylan, I., Wolter, F.: Query rewriting under EL TBoxes: efficient algorithms. In: Description Logics (2014)

    Google Scholar 

  12. Hansen, P., Lutz, C., Seylan, I., Wolter, F.: Efficient query rewriting in the description logic EL and beyond. In: IJCAI (2015)

    Google Scholar 

  13. Kikot, S., Kontchakov, R., Zakharyaschev, M.: Conjunctive query answering with OWL 2 QL. In: KR (2012)

    Google Scholar 

  14. Kontchakov, R., Zakharyaschev, M.: An introduction to description logics and query rewriting. In: Koubarakis, M., Stamou, G., Stoilos, G., Horrocks, I., Kolaitis, P., Lausen, G., Weikum, G. (eds.) Reasoning Web. LNCS, vol. 8714, pp. 195–244. Springer, Heidelberg (2014)

    Google Scholar 

  15. Mosurovic, M., Krdzavac, N., Graves, H., Zakharyaschev, M.: A decidable extension of SROIQ with complex role chains and unions. JAIR 47, 809–851 (2013)

    MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  17. Schewe, K.-D., Thalheim, B.: Semantics in data and knowledge bases. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 1–25. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Rosati, R.: On conjunctive query answering in EL. In: DL (2007)

    Google Scholar 

Download references

Acknowledgments

We thank Michael Zakharyaschev and Roman Kontchakov for precious discussions about this material.

Author information

Authors and Affiliations

  1. Knowledge Lab, Birkbeck, University of London, London, UK

    Mirko M. Dimartino, Andrea Calì, Alexandra Poulovassilis & Peter T. Wood

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

    Andrea Calì

Authors
  1. Mirko M. Dimartino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Calì
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexandra Poulovassilis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter T. Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mirko M. Dimartino .

Editor information

Editors and Affiliations

  1. Vienna University of Technology , Vienna, Austria

    Magdalena Ortiz

  2. Computer Science, Vrije Universiteit Amsterdam, Amsterdam, Noord-Holland, The Netherlands

    Stefan Schlobach

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dimartino, M.M., Calì, A., Poulovassilis, A., Wood, P.T. (2016). Query Rewriting under Linear \(\mathcal {EL}\) Knowledge Bases. In: Ortiz, M., Schlobach, S. (eds) Web Reasoning and Rule Systems. RR 2016. Lecture Notes in Computer Science(), vol 9898. Springer, Cham. https://doi.org/10.1007/978-3-319-45276-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45276-0_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45275-3

  • Online ISBN: 978-3-319-45276-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation