![]() | Up a level |
Artificial Intelligence
Gerasimova, O. and Kikot, Stanislav and Kurucz, A. and Podolskii, V. and Zakharyashchev, Michael (2022) A tetrachotomy of ontology-mediated queries with a covering axiom. Artificial Intelligence 309 , p. 103738. ISSN 0004-3702.
Gottlob, G. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Schwentick, T. and Zakharyaschev, Michael (2014) The price of query rewriting in ontology-based data access. Artificial Intelligence 213 , pp. 42-59. ISSN 0004-3702.
CEUR Workshop Proceedings
Gerasimova, O. and Kikot, S. and Podolskii, V. and Zakharyaschev, Michael (2017) On the data complexity of ontology-mediated queries with a covering axiom. In: Artale, A. and Glimm, B. and Kontchakov, Roman (eds.) DL 2017: International Workshop on Description Logics. CEUR Workshop Proceedings 1879 1879. CEUR Workshop Proceedings.
Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2012) Long rewritings, short rewritings. In: UNSPECIFIED (ed.) Proceedings of the 2012 International Workshop on Description Logics, DL-2012, Rome, Italy, June 7-10, 2012. CEUR Workshop Proceedings 846. CEUR Workshop Proceedings.
Journal of the ACM
Bienvenu, M. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2018) Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity. Journal of the ACM 65 (5), ISSN 0004-5411.
Lecture Notes in Computer Science
Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2012) Exponential lower bounds and separation for query rewriting. In: Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R. (eds.) Automata, Languages, and Programming. Lecture Notes in Computer Science 7392 7392. Berlin, Germany: Springer, pp. 263-274. ISBN 9783642315848.