Stanislav Kikot

Research

Generally speaking, I am interested in all aspects of modal and first-order logic and their fragments, including computational complexity and model and proof theory. However, my research is focused on areas where these domains converge, namely, on correspondence theory, many-dimensional modal logics, and, recently, on query answering in description logics.

PhD Thesis

The thesis was written in Moscow in 2006 - 2010 under supervision of Valentin Shehtman. Its title is "On modal logics of elementary generated classes of Kripke frames", and it contains material on generalised Sahlqvist and Kracht formulas (published in [1] and [2] in the list below), modal definability of first-order formulas with many free variables (published in [12]) and its application to 2-dimensional modal logics with a diagonal constant (published in [3]). The public defence took place on 1 October 2010 in Moscow State University; the referees were Larisa Maksimova, Mikhail Rybakov and Lev Beklemishev. The complete text of the thesis (in Russian) can be downloaded here.

Publications

    2009

  1. S. Kikot, An extension of Kracht's theorem to generalized Sahlqvist formulas. Journal of Applied Non-Classical Logic, 19/2, 2009, 227--251. arxiv

    2010

  2. S. Kikot, Semantic characterization of Kracht's formulas. Advances in Modal Logic 8. College Publications, 2010, 218-234. pdf
  3. S. Kikot, Axiomatization of Modal Logic Squares with Distinguished Diagonal, Mat. Zametki, 2010, Volume 88, Issue 2, Pages 261-274 (Mi mz8804) mz-site
  4. S. Kikot, Relation Algebras by Games , by Robin Hirsch and Ian Hodkinson. (Book review) J. Log. Comput. 20(2): 645-648 (2010) doi

    2011

  5. S. Kikot, R. Kontchakov and M. Zakharyaschev. On (In)Tractability of OBDA with OWL 2 QL. In R. Rosati, S. Rudolph and M. Zakharyaschev, editors, Proceedings of DL (Barcelona, 13-16 July), pp.  224-234. CEUR Workshop Proceedings, vol. 745, 2011. pdf
  6. S. Kikot. On modal definability of Horn formulas. Topology, Algebra and Categories in Logic - 2011, Marseille. pdf
  7. S. Kikot, R. Kontchakov and M. Zakharyaschev. Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies. In S. Rudolph and C. Gutierrez, editors, Proceedings of RR (Galway, Ireland, 29-30 August), LNCS vol. 6902, pp. 124-138. Springer, 2011. pdf
  8. 2012

  9. S. Kikot, R. Kontchakov and M. Zakharyaschev. Conjunctive Query Answering with OWL2QL. KR-2012. pdf (full text) queries
  10. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Exponential Lower Bounds and Separation for Query Rewriting. In A. Czumaj, K. Mehlhorn, A. Pitts and R. Wattenhofer, editors, Proceedings of ICALP (Warwick, 9-13 July), Part II, LNCS vol. 7392, pp. 263-274. Springer, 2012. (full version)
  11. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Long Rewritings, Short Rewritings. In Y. Kazakov, D. Lembo and F. Wolter, editors, Proceedings of DL (Rome, 7-10 June), pp. 235-245. CEUR Workshop Proceedings, vol. 846, 2012. pdf
  12. P. Balbiani, S. Kikot, Sahlqvist theorems for precontact logics. In Advances in Modal Logic 9 (2012), pp. 55--70. preprint
  13. 2013

  14. S. Kikot, E. Zolin. Modal definability of first-order formulas with free variables and query answering . Journal of Applied Logic 11 (2013), pp. 190-216. preprint
  15. S. Kikot, D. Tsarkov, M. Zakharyaschev and E. Zolin. Query Answering via Modal Definability with FaCT++: First Blood. In Proceedings of DL 2013. pdf
  16. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Query Rewriting over Shallow Ontologies. In Proceedings of DL 2013. full version

    2014

  17. G. Gottlob, S. Kikot, R. Kontchakov, V. Podolskii, T. Schwentick and M. Zakharyaschev. The Price of Query Rewriting in Ontology-Based Data Access. Artificial Intelligence, 213:42-59, 2014. preprint
  18. S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. On the Succinctness of Query Rewriting over Shallow Ontologies. In LICS 2014. full version conference version
  19. M. Bienvenu, S. Kikot, V. Podolskii. Succintness of Query Rewriting in OWL 2 QL : The Case of Tree-like Queries In DL 2013. arxiv
  20. S. Kikot, I. Shapirovsky, E. Zolin. Filtration Safe Operations on Frames In Advances in Modal Logic 10 (2014), pp. 333-352. pdf

    2015

  21. S. Kikot. A Dichotomy for Some Elementarily Generated Modal Logics. Studia Logica 103(5): 1063-1093 (2015) pdf
  22. M. Bienvenu, S. Kikot, V. Podolskii. Combined Complexity of Answering Tree-like Queries in OWL 2 QL. In Proceedings of the DL 2015, Athens. pdf
  23. M. Bienvenu, S. Kikot, V. Podolskii. Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results In Proceedings of the LICS 2015, Kyoto, pp. 317-328.pdf
  24. S. Kikot. First order formulas which are preserved under minimal filtrations. Proceeding of ITAS 2015, Sochi. pdf (in Russian)