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

  • Olga GerasimovaEmail author
  • Stanislav Kikot
  • Vladimir Podolskii
  • Michael Zakharyaschev
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 786)


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.



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.


  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Menlo Park (1995)zbMATHGoogle Scholar
  2. 2.
    Afrati, F.N., Gergatsoulis, M., Toni, F.: Linearisability on datalog programs. Theor. Comput. Sci. 308(1—-3), 199–226 (2003).
  3. 3.
    Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR) 36, 1–69 (2009)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)CrossRefzbMATHGoogle Scholar
  5. 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)MathSciNetCrossRefGoogle Scholar
  6. 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 CrossRefGoogle Scholar
  7. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 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).
  9. 9.
    Feier, C., Kuusisto, A., Lutz, C.: Rewritability in monadic disjunctive datalog, MMSNP, and expressive description logics. CoRR abs/1701.02231 (2017).
  10. 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. 11.
    Gottlob, G., Papadimitriou, C.H.: On the complexity of single-rule datalog queries. Inf. Comput. 183(1), 104–122 (2003).
  12. 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).
  13. 13.
    Hernich, A., Lutz, C., Ozaki, A., Wolter, F.: 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. (2015).
  14. 14.
    Kaminski, M., Nenov, Y., Grau, B.C.: Datalog rewritability of disjunctive datalog programs and non-Horn ontologies. Artif. Intell. 236, 90–118 (2016).
  15. 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 CrossRefGoogle Scholar
  16. 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 CrossRefGoogle Scholar
  17. 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 CrossRefGoogle Scholar
  18. 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. 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)CrossRefzbMATHGoogle Scholar
  20. 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 CrossRefGoogle Scholar
  21. 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)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Olga Gerasimova
    • 1
    Email author
  • Stanislav Kikot
    • 2
  • Vladimir Podolskii
    • 1
    • 3
  • Michael Zakharyaschev
    • 2
  1. 1.National Research University Higher School of EconomicsMoscowRussia
  2. 2.Birkbeck, University of LondonLondonUK
  3. 3.Steklov Mathematical InstituteMoscowRussia

Personalised recommendations