Dr Stanislav Kikot

Dr Stanislav Kikot is a Senior Lecturer in Artificial Intelligence for the School of Computing and Digital Media.  

Dr Stanislav Kikot is a Senior Lecturer for the Artificial Intelligence MSc. He was previously a postdoctoral researcher at the University of Oxford, where he worked on query planning in databases. He also spent time at Birkbeck College where he worked on ontology-based data access. From 2006 to 2010 he did a PhD in Modal Logic and went onto work for Russian search engine Yandex, so his expertise also covers automated reasoning, natural language processing, web navigation and information retrieval.

Dr Kikot's current research interests focus on applications of logic-based AI and machine learning to data management and data analysis. At London Met, he teaches modules related to artificial intelligence and machine learning.

Journal Articles:

  • C. Hampson, S. Kikot, A. Kurucz, S. Marcelino: Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. Annals of Pure and Applied Logic, 171(5): 102786 (2020)
  • S. Kikot, A. Kurucz, Y. Tanaka, F. Wolter, M. Zakharyaschev. Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators. Journal of Symbolic Logic, 84(2): 533-588 (2019)
  • M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev. Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. Journal of the ACM, 65(5): 28:1-28:51 (2018)
  • C. Hampson, S. Kikot and A. Kurucz. The decision problem of modal product logics with a diagonal, and faulty counter machines. Studia Logica, 104(3): 455-486 (2016).
  • S. Kikot. A dichotomy for some elementarily generated modal logics. Studia Logica, 103(5): 1063-1093 (2015).
  • 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 (2014), Elsevier, pp. 42-59.
  • S. Kikot, E. Zolin. Modal definability of first-order formulas with free variables and query answering. Journal of Applied Logic, 11 (2013), Elsevier, pp. 190-216.
  • S. P. Kikot', Axiomatization of Modal Logic Squares with Distinguished Diagonal, Mathematical Notes, 2010, volume 88, issue 2, pages 261-274.
  • S. Kikot, An extension of Kracht's theorem to generalized Sahlqvist formulas. Journal of Applied Non-Classical Logic, 19/2, 2009, 227-251.

 

Refereed Conference Papers:

  • Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero: On monotonic determinacy and rewritability for recursive queries and views. To appear in PODS 2020:  Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Portland, USA, 15-19 June  2020.
  • S. Kikot, R. Kontchakov, S. Rapisarda and M. Zakharyaschev. STYPES: Nonrecursive Datalog Rewriter for Linear TGDs and Conjunctive Queries. In ODBASE 2018 : Proceedings of the 17th International Conference on Ontologies, DataBases, and Applications of Semantics, Valletta, Malta, 23-24 October, vol. 11230 of LNCS, Springer, 2018.
  • S. Kikot, A. Kurucz, F. Wolter, M. Zakharyaschev. On Strictly Positive Modal Logics with S4.3 Frames. In Advances in Modal Logic 12 : Proceedings of the 12th conference "Advances in Modal Logic" held in Bern, Switzerland, August 27-31, 2018, pp. 427-446.
  • O. Gerasimova, S. Kikot, V. Podolskii, M. Zakharyaschev. More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom. In KESW 2017 : Proceedings of 8th International Conference on Knowledge Engineering and Semantic Web, Szczecin, Poland, November 8-10, 2017, pp. 143-158.
  • S. Kikot, A. Kurucz, F. Wolter and M. Zakharyaschev. Altn in a Strictly Positive Context. In TACL 2017 : Proceedings of the 8th International Conference on Topology, Algebra and Categories in Logic, July 2017,  Prague.
  • M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, V. Ryzhikov, M. Zakharyaschev. The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. In PODS 2017 : Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Chicago, USA, 14-19 May 2017, pp. 201-216.
  • M. Bienvenu, S. Kikot, V. Podolskii. Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. In LICS 2015: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, Kyoto, Japan, July 6-10, 2015, pp. 317-328
  • S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. On the Succinctness of Query Rewriting  over Shallow Ontologies. In CSL-LICS 2014 : Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Vienna, Austria, July 14-18, 2014, 57.
  • S. Kikot, I. Shapirovsky, E. Zolin. Filtration Safe Operations on Frames. In Advances in Modal Logic 10 (2014), pp. 333-352.
  • 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 2012 : 39th International Colloquium on Automata, Languages and Programming (Warwick, 9-13 July), Part II, LNCS vol. 7392, pp. 263-274. Springer, 2012.
  • S. Kikot, R. Kontchakov and M. Zakharyaschev. Conjunctive Query Answering with OWL 2 QL. In Gerhard Brewka, Thomas Eiter, Sheila A. McIlraith (Eds.): Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012.
  • P. Balbiani, S. Kikot, Sahlqvist theorems for precontact logics. In Advances in Modal Logic 9, 2012, Thomas Bolander, Torben Brauner, Silvio Ghilardi, and Lawrence Moss, eds., pp. 55-70.
  • 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 2011 : The Fifth International Conference on Web Reasoning and Rule Systems (Galway, Ireland, 29-30 August), LNCS vol. 6902, pp. 124-138. Springer, 2011. Best paper award.
  • S. Kikot. On modal definability of Horn formulas. In Proceedings of Topology, Algebra and Categories in Logic, 2011, Marseille, ed. L. Santocanale, N. Olevetti, Yves Lafont, pp. 175-178.
  • S. Kikot, Semantic characterization of Kracht's formulas. In Advances in Modal Logic 8. College  Publications, 2010, pp. 218-234.

 

Refereed Workshop Papers:

  • O. Gerasimova, S. Kikot, M. Zakharyaschev. Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Polyanna. In Description Logic, Theory Combination, and All That, Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, 2019, pp. 329-351.
  • S. Kikot, V. Ryzhikov, P. Walega, M. Zakharyaschev. On the Data Complexity of Ontology-Mediated
  • Queries with MTL Operators over Timed Words. In Proceedings of DL 2018 : 31st International Workshop on Description Logics, Tempe, Arizona, October 2018.
  • M. Zakharyaschev, S. Kikot, O. Gerasimova. Towards a Data Complexity Classification of Ontology-Mediated Queries with Covering. In Proceedings of DL 2018 : 31st International Workshop on Description Logics, Tempe, Arizona, October 2018.
  • O. Gerasimova, S. Kikot, V. Podolskii, M. Zakharyaschev: On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom. In Proceedings of DL 2017 : 30th International Workshop on Description Logics (Monpellier, France, 18-21 July 2017).
  • M. Bienvenu, S. Kikot, R. Kontchakov, V. Ryzhikov, M. Zakharyaschev: On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL. In Proceedings of DL 2017 : 30th International Workshop on Description Logics (Monpellier, France, 18-21 July 2017).
  • M. Bienvenu, S. Kikot, R. Kontchakov, V. Ryzhikov, M. Zakharyaschev: Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries. In Proceedings of DL 2017 : 30th International Workshop on Description Logics (Monpellier, France, 18-21 July 2017).
  • M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev: Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries. In Proceedings of DL 2016 : 29th International Workshop on Description Logics (Cape Town, 22-25 April 2016).
  • M. Bienvenu, S. Kikot and V. Podolskii. Combined Complexity of Answering Tree-like Queries in OWL 2 QL. In Proceedings of DL 2015 : 28th International Workshop on Description Logics (Athens, 7-10 June 2015).
  • M. Bienvenu, S. Kikot and V. Podolskii. Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. In Proceedings of DL 2014 : 27th International Workshop on Description Logics (Vienna, 17-21 July 2014).
  • S. Kikot, R. Kontchakov, V. Podolskii and M. Zakharyaschev. Query Rewriting over Shallow Ontologies. In Proceedings of DL 2013 : 26th International Workshop on Description Logics (Ulm, 22-27 July), pp. 316-327, CEUR Workshop Proceedings, vol. 1014, 2013.
  • S. Kikot, D. Tsarkov, M. Zakharyaschev and E. Zolin. Query Answering via Modal Definability with FaCT++: First Blood. In Proceedings of DL 2013 : 26th International Workshop on Description Logics (Ulm, 22-27 July), pp. 328-340, CEUR Workshop Proceedings, vol. 1014, 2013.
  • 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 2012 : 25th International Workshop on Description Logics (Rome, 7-10 June), pp. 235-245. CEUR Workshop Proceedings, vol. 846, 2012.
  • 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 2011 : 24th International Workshop on Description Logics (Barcelona, 13-16 July), pp. 224-234. CEUR Workshop Proceedings, vol. 745, 2011.

 

 

Dr Stan Kikot
Senior Lecturer in Artificial Intelligence