An extension of Kracht's theorem to generalized Sahlqvist formulas. - Stanislav Kikot (J. Appl. Non Class. Logics, 2009)

Semantic Characterization of Kracht Formulas. - Stanislav Kikot (Advances in Modal Logic, 2010)

Relation Algebras by Games, by Robin Hirsch and Ian Hodkinson. - Stanislav Kikot (J. Log. Comput., 2010)

On (In)Tractability of OBDA with OWL 2 QL. - Stanislav Kikot; Roman Kontchakov; Michael Zakharyaschev (Description Logics, 2011)

Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies. - Stanislav Kikot; Roman Kontchakov; Michael Zakharyaschev (RR, 2011)

Sahlqvist Theorems for Precontact Logics. - Philippe Balbiani; Stanislav Kikot (Advances in Modal Logic, 2012)

Long Rewritings, Short Rewritings. - Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (Description Logics, 2012)

Exponential Lower Bounds and Separation for Query Rewriting. - Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (ICALP (2), 2012)

Conjunctive Query Answering with OWL 2 QL. - Stanislav Kikot; Roman Kontchakov; Michael Zakharyaschev (KR, 2012)

Query Rewriting over Shallow Ontologies. - Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (Description Logics, 2013)

Query Answering via Modal Definability with FaCT++: First Blood. - Stanislav Kikot; Dmitry Tsarkov; Michael Zakharyaschev; Evgeny Zolin (Description Logics, 2013)

Modal definability of first-order formulas with free variables and query answering. - Stanislav Kikot; Evgeny Zolin (J. Appl. Log., 2013)

Filtration Safe Operations on Frames. - Stanislav Kikot; Ilya Shapirovsky; Evgeny Zolin (Advances in Modal Logic, 2014)

On the succinctness of query rewriting over shallow ontologies. - Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (CSL-LICS, 2014)

Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. - Meghyn Bienvenu; Stanislav Kikot; Vladimir V. Podolskii (Description Logics, 2014)

The price of query rewriting in ontology-based data access. - Georg Gottlob; Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Thomas Schwentick; Michael Zakharyaschev (Artif. Intell., 2014)

On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Shallow Chases. - Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (CoRR, 2014)

Combined Complexity of Answering Tree-like Queries in OWL 2 QL. - Meghyn Bienvenu; Stanislav Kikot; Vladimir V. Podolskii (Description Logics, 2015)

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. - Meghyn Bienvenu; Stanislav Kikot; Vladimir V. Podolskii (LICS, 2015)

A Dichotomy for Some Elementarily Generated Modal Logics. - Stanislav Kikot (Stud Logica, 2015)

Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries. - Meghyn Bienvenu; Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (Description Logics, 2016)

The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines. - Christopher Hampson; Stanislav Kikot; Ágnes Kurucz (Stud Logica, 2016)

On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL. - Meghyn Bienvenu; Stanislav Kikot; Roman Kontchakov; Vladislav Ryzhikov; Michael Zakharyaschev (Description Logics, 2017)

Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries. - Meghyn Bienvenu; Stanislav Kikot; Roman Kontchakov; Vladislav Ryzhikov; Michael Zakharyaschev (Description Logics, 2017)

On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom. - Olga Gerasimova; Stanislav Kikot; Vladimir V. Podolskii; Michael Zakharyaschev (Description Logics, 2017)

More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom. - Olga Gerasimova; Stanislav Kikot; Vladimir V. Podolskii; Michael Zakharyaschev (KESW, 2017)

The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. - Meghyn Bienvenu; Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Vladislav Ryzhikov; Michael Zakharyaschev (PODS, 2017)

Kripke Completeness of Strictly Positive Modal Logics Over Meet Semi-Lattices with Operators. - Stanislav Kikot (Advances in Modal Logic, 2018)

On Strictly Positive Modal Logics with S4.3 Frames. - Stanislav Kikot; Agi Kurucz; Frank Wolter; Michael Zakharyaschev (Advances in Modal Logic, 2018)

On the Data Complexity of Ontology-Mediated Queries with MTL Operators over Timed Words. - Stanislav Kikot; Vladislav Ryzhikov; Przemyslaw Andrzej Walega; Michael Zakharyaschev (Description Logics, 2018)

Towards a Data Complexity Classification of Ontology-Mediated Queries with Covering. - Michael Zakharyaschev; Stanislav Kikot; Olga Gerasimova (Description Logics, 2018)

STypeS: Nonrecursive Datalog Rewriter for Linear TGDs and Conjunctive Queries. - Stanislav Kikot; Roman Kontchakov; Salvatore Rapisarda; Michael Zakharyaschev (OTM Conferences (2), 2018)

Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. - Meghyn Bienvenu; Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (J. ACM, 2018)

Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Polyanna. - Olga Gerasimova; Stanislav Kikot; Michael Zakharyaschev (Description Logic, Theory Combination, and All That, 2019)

Kripke Completeness of strictly positive Modal Logics over Meet-Semilattices with operators. - Stanislav Kikot; Agi Kurucz; Yoshihito Tanaka; Frank Wolter; Michael Zakharyaschev (J. Symb. Log., 2019)

Modal Logics with Transitive Closure: Completeness, Decidability, Filtration. - Stanislav Kikot; Ilya Shapirovsky; Evgeny Zolin (AiML, 2020)

A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom. - Olga Gerasimova; Stanislav Kikot; Agi Kurucz; Vladimir V. Podolskii; Michael Zakharyaschev (KR, 2020)

Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. - Christopher Hampson; Stanislav Kikot; Agi Kurucz; Sérgio Marcelino (Ann. Pure Appl. Log., 2020)

Deciding Boundedness of Monadic Sirups. - Stanislav Kikot; Agi Kurucz; Vladimir V. Podolskii; Michael Zakharyaschev (PODS, 2021)

A tetrachotomy of ontology-mediated queries with a covering axiom. - Olga Gerasimova; Stanislav Kikot; Agi Kurucz; Vladimir V. Podolskii; Michael Zakharyaschev (Artif. Intell., 2022)

Spatial Intelligence of a Self-driving Car and Rule-Based Decision Making. - Stanislav Kikot (CoRR, 2023)

On Monotonic Determinacy and Rewritability for Recursive Queries and Views. - Michael Benedikt; Stanislav Kikot; Piotr Ostropolski-Nalewaja; Miguel Romero 001 (ACM Trans. Comput. Log., 2023)

Monotone Rewritability and the Analysis of Queries, Views, and Rules. - Michael Benedikt; Stanislav Kikot; Johannes Marti; Piotr Ostropolski-Nalewaja (KR, 2024)