| The price of query rewriting in ontology-based data access G Gottlob, S Kikot, R Kontchakov, V Podolskii, T Schwentick, ... Artificial Intelligence 213, 42-59, 2014 | 107 | 2014 |
| Conjunctive Query Answering with OWL 2 QL. S Kikot, R Kontchakov, M Zakharyaschev KR, 2012 | 79 | 2012 |
| On (in) tractability of OBDA with OWL 2 QL S Kikot, R Kontchakov, M Zakharyaschev CEUR Workshop Proceedings, 2011 | 53 | 2011 |
| Exponential lower bounds and separation for query rewriting S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 46 | 2012 |
| Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity M Bienvenu, S Kikot, R Kontchakov, VV Podolskii, M Zakharyaschev Journal of the ACM (JACM) 65 (5), 1-51, 2018 | 32 | 2018 |
| Kripke completeness of strictly positive modal logics over meet-semilattices with operators S Kikot, A Kurucz, Y Tanaka, F Wolter, M Zakharyaschev The Journal of Symbolic Logic 84 (2), 533-588, 2019 | 25 | 2019 |
| The complexity of ontology-based data access with OWL 2 QL and bounded treewidth queries M Bienvenu, S Kikot, R Kontchakov, VV Podolskii, V Ryzhikov, ... Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 21 | 2017 |
| On the Data Complexity of Ontology-Mediated Queries with MTL Operators over Timed Words. S Kikot, V Ryzhikov, PA Walega, M Zakharyaschev Description Logics 2211, 2018 | 17 | 2018 |
| Modal definability of first-order formulas with free variables and query answering S Kikot, E Zolin Journal of Applied Logic 11 (2), 190-216, 2013 | 17 | 2013 |
| Sahlqvist theorems for precontact logics P Balbiani, S Kikot 9th Advances in Modal Logic conference (AiML 2012), 55--70, 2012 | 17 | 2012 |
| Tree-like queries in OWL 2 QL: succinctness and complexity results M Bienvenu, S Kikot, V Podolskii 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 317-328, 2015 | 15 | 2015 |
| An extension of Kracht's theorem to generalized Sahlqvist formulas S Kikot Journal of Applied Non-Classical Logics 19 (2), 227-251, 2009 | 13 | 2009 |
| On the succinctness of query rewriting over shallow ontologies S Kikot, R Kontchakov, VV Podolskii, M Zakharyaschev Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 12 | 2014 |
| A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom O Gerasimova, S Kikot, A Kurucz, V Podolskii, M Zakharyaschev Proceedings of the Seventeenth International Conference on Principles of …, 2020 | 11 | 2020 |
| Filtration safe operations on frames S Kikot, I Shapirovsky, E Zolin Advances in modal logic 10, 333-352, 2014 | 11 | 2014 |
| Query Answering via Modal Definability with FaCT++: First Blood. S Kikot, D Tsarkov, M Zakharyaschev, E Zolin Description Logics, 328-340, 2013 | 11 | 2013 |
| Long rewritings, short rewritings S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev Proceedings of the 2012 International Workshop on Description Logics, 2012 | 11 | 2012 |
| Axiomatization of modal logic squares with distinguished diagonal SP Kikot’ Mathematical Notes 88, 238-250, 2010 | 11 | 2010 |
| Query rewriting over shallow ontologies S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev CEUR-WS, 2013 | 10 | 2013 |
| On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom. O Gerasimova, S Kikot, VV Podolskii, M Zakharyaschev Description Logics, 1, 2017 | 9 | 2017 |
Michael ZakharyaschevBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk
