iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-319-69548-8_11
More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom | SpringerLink
Skip to main content
Springer Nature Link
Log in

More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom

  • Conference paper
  • First Online:
Knowledge Engineering and Semantic Web (KESW 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 786))

Included in the following conference series:

Abstract

We report on our recent results in the ongoing attempts to classify conjunctive queries (CQs) \({\varvec{q}}\) according to the data complexity of answering ontology-mediated queries of the form \((\{A \sqsubseteq F \sqcup T\},{\varvec{q}})\). In particular, we present new families of path CQs for which this problem is NL-, P- or coNP-complete.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.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 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

Similar content being viewed by others

Notes

  1. 1.

    https://www.w3.org/TR/owl2-profiles/.

  2. 2.

    The OMQ \({{\varvec{Q}}= (\mathcal {D}{is}_\top , {\varvec{q}})}\) with this CQ \({\varvec{q}}\) can be interpreted as follows, assuming that F stands for ‘female’, T for ‘male’, \(\top \) for all the individuals of the domain in question, and R for the ‘follows’ relation: given a graph of Twitter users, in which the gender may be specified for some nodes and missing for the other ones, check whether there certainly exist two people (nodes) in the graph of different gender who follow each other.

References

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

    MATH  Google Scholar 

  2. Afrati, F.N., Gergatsoulis, M., Toni, F.: Linearisability on datalog programs. Theor. Comput. Sci. 308(1—-3), 199–226 (2003). https://doi.org/10.1016/S0304-3975(02)00730-2

  3. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR) 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)

    Book  MATH  Google Scholar 

  5. Bienvenu, M., ten Cate, B., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4), 33:1–44 (2014)

    Article  MathSciNet  Google Scholar 

  6. Bienvenu, M., Ortiz, M.: Ontology-mediated query answering with data-tractable description logics. In: Faber, W., Paschke, A. (eds.) Reasoning Web 2015. LNCS, vol. 9203, pp. 218–307. Springer, Cham (2015). doi:10.1007/978-3-319-21768-0_9

    Chapter  Google Scholar 

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

  8. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335–360 (2013). https://doi.org/10.1016/j.artint.2012.10.003

  9. Feier, C., Kuusisto, A., Lutz, C.: Rewritability in monadic disjunctive datalog, MMSNP, and expressive description logics. CoRR abs/1701.02231 (2017). http://arxiv.org/abs/1701.02231

  10. Gerasimova, O., Kikot, S., Podolskii, V., Zakharyaschev, M.: On the data complexity of ontology-mediated queries with a covering axiom. In: Proceedings of the 30th International Workshop on Description Logics (2017)

    Google Scholar 

  11. Gottlob, G., Papadimitriou, C.H.: On the complexity of single-rule datalog queries. Inf. Comput. 183(1), 104–122 (2003). http://dx.doi.org/10.1016/S0890-5401(03)00012-9

  12. Grau, B.C., Motik, B., Stoilos, G., Horrocks, I.: Computing datalog rewritings beyond horn ontologies. In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3–9, 2013, pp. 832–838 (2013). http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6318

  13. Hernich, A., Lutz, C., Ozaki, A., Wolter, F.: Schema.org as a description logic. In: Calvanese, D., Konev, B. (eds.) Proceedings of the 28th International Workshop on Description Logics, Athens, Greece, June 7–10, 2015, CEUR Workshop Proceedings, vol. 1350. CEUR-WS.org (2015). http://ceur-ws.org/Vol-1350/paper-24.pdf

  14. Kaminski, M., Nenov, Y., Grau, B.C.: Datalog rewritability of disjunctive datalog programs and non-Horn ontologies. Artif. Intell. 236, 90–118 (2016). http://dx.doi.org/10.1016/j.artint.2016.03.006

  15. Kontchakov, R., Rodríguez-Muro, M., Zakharyaschev, M.: Ontology-based data access with databases: a short course. In: Rudolph, S., Gottlob, G., Horrocks, I., van Harmelen, F. (eds.) Reasoning Web 2013. LNCS, vol. 8067, pp. 194–229. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39784-4_5

    Chapter  Google Scholar 

  16. 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 2014. LNCS, vol. 8714, pp. 195–244. Springer, Cham (2014). doi:10.1007/978-3-319-10587-1_5

    Chapter  Google Scholar 

  17. Krisnadhi, A., Lutz, C.: Data complexity in the \(\cal{EL}\) family of description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS, vol. 4790, pp. 333–347. Springer, Heidelberg (2007). doi:10.1007/978-3-540-75560-9_25

    Chapter  Google Scholar 

  18. Lutz, C., Sabellek, L.: Ontology-mediated querying with \(\cal{EL}\): Trichotomy and linear datalog rewritabvility. In: Proceedings of the 30th International Workshop on Description Logics (2017)

    Google Scholar 

  19. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semant. X 4900, 133–173 (2008)

    Article  MATH  Google Scholar 

  20. Rosati, R.: The limits of querying ontologies. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 164–178. Springer, Heidelberg (2006). doi:10.1007/11965893_12

    Chapter  Google Scholar 

  21. Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. J. Intell. Inf. Syst. 2, 265–278 (1993)

    Article  Google Scholar 

Download references

Acknowledgements

The work of O. Gerasimova and M. Zakharyaschev was carried out at the National Research University Higher School of Economics and supported by the Russian Science Foundation under grant 17-11-01294; the work of V. Podolskii was supported by the Russian Academic Excellence Project ‘5-100’ and by grant MK-7312.2016.1.

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, Moscow, Russia

    Olga Gerasimova & Vladimir Podolskii

  2. Birkbeck, University of London, London, UK

    Stanislav Kikot & Michael Zakharyaschev

  3. Steklov Mathematical Institute, Moscow, Russia

    Vladimir Podolskii

Authors
  1. Olga Gerasimova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stanislav Kikot
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimir Podolskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Zakharyaschev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olga Gerasimova .

Editor information

Editors and Affiliations

  1. West Pomeranian University of Technology in Szczecin, Szczecin, Poland

    Przemysław Różewski

  2. University of Bonn, Bonn, Germany

    Christoph Lange

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gerasimova, O., Kikot, S., Podolskii, V., Zakharyaschev, M. (2017). More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom. In: Różewski, P., Lange, C. (eds) Knowledge Engineering and Semantic Web. KESW 2017. Communications in Computer and Information Science, vol 786. Springer, Cham. https://doi.org/10.1007/978-3-319-69548-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69548-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69547-1

  • Online ISBN: 978-3-319-69548-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation