Browse by Person

Advances in Modal Logic

Balbiani, P. and Kikot, Stanislav (2012) Sahlqvist theorems for precontact logics. In: Bolander, T. and Braner, T. and Ghilardi, S. and Moss, L.S. (eds.) Advances in Modal Logic. London, UK: College Publications, pp. 55-70. ISBN 9781848900684.

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

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 Applied Logic

Kikot, Stanislav and Zolin, E. (2013) Modal definability of first-order formulas with free variables and query answering. Journal of Applied Logic 11 (2), pp. 190-216. ISSN 1570-8683.

Journal of Applied Non-Classical Logics

Kikot, Stanislav (2009) An extension of Kracht's theorem to generalized Sahlqvist formulas. Journal of Applied Non-Classical Logics 19 (2), pp. 227-251. ISSN 1166-3081.

Journal of Symbolic Logic

Kikot, Stanislav and Kurucz, A. and Tanaka, Y. and Wolter, F. and Zakharyaschev, Michael (2019) Kripke completeness of strictly positive modal logics over meet-semilattices with operators. Journal of Symbolic Logic 84 (2), pp. 533-588. ISSN 0022-4812.

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.

Kikot, Stanislav and Kontchakov, Roman and Zakharyaschev, Michael (2011) Polynomial conjunctive query rewriting under unary inclusion dependencies. In: Rudolph, S. and Gutierrez, C. (eds.) Web Reasoning and Rule Systems (5th International Conference, RR 2011). Lecture Notes in Computer Science 6902. Berlin, Germany: Springer, pp. 124-138. ISBN 9783642235795.