Stanislav Kikot

56 papers A* 7B 6Journal 25Unranked 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Pipeline for Verifying LLM-Generated Mathematical Solutions.
CoRR
Varvara Sazonova, Dmitri Shmelkin, Stanislav Kikot, Vasily Motolygin
2024 A* conf
Monotone Rewritability and the Analysis of Queries, Views, and Rules.
KR
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
2024 J jnl
Monotone Rewritability and the Analysis of Queries, Views, and Rules.
CoRR
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
2023 J jnl
On Monotonic Determinacy and Rewritability for Recursive Queries and Views.
ACM Trans. Comput. Log.
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2023 J jnl
Spatial Intelligence of a Self-driving Car and Rule-Based Decision Making.
CoRR
Stanislav Kikot
2022 J jnl
A tetrachotomy of ontology-mediated queries with a covering axiom.
Artif. Intell.
Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev
2021 A* conf
Deciding Boundedness of Monadic Sirups.
PODS
Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev
2021 J jnl
Deciding boundedness of monadic sirups.
CoRR
Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev
2020 A* conf
A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom.
KR
Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev
2020 J jnl
A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom.
CoRR
Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev
2020 B conf
Modal Logics with Transitive Closure: Completeness, Decidability, Filtration.
AiML
Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin
2020 J jnl
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations.
Ann. Pure Appl. Log.
Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino
2020 A* conf
On Monotonic Determinacy and Rewritability for Recursive Queries and Views.
PODS
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2020 J jnl
On monotonic determinacy and rewritability for recursive queries and views.
CoRR
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2019 — conf
Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Polyanna.
Description Logic, Theory Combination, and All That
Olga Gerasimova, Stanislav Kikot, Michael Zakharyaschev
2019 J jnl
Kripke Completeness of strictly positive Modal Logics over Meet-Semilattices with operators.
J. Symb. Log.
Stanislav Kikot, Agi Kurucz, Yoshihito Tanaka, Frank Wolter, Michael Zakharyaschev
2019 J jnl
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations.
CoRR
Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino
2018 B conf
Kripke Completeness of Strictly Positive Modal Logics Over Meet Semi-Lattices with Operators.
Advances in Modal Logic
Stanislav Kikot
2018 B conf
On Strictly Positive Modal Logics with S4.3 Frames.
Advances in Modal Logic
Stanislav Kikot, Agi Kurucz, Frank Wolter, Michael Zakharyaschev
2018 — conf
On the Data Complexity of Ontology-Mediated Queries with MTL Operators over Timed Words.
Description Logics
Stanislav Kikot, Vladislav Ryzhikov, Przemyslaw Andrzej Walega, Michael Zakharyaschev
2018 J jnl
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity.
J. ACM
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2018 — conf
STypeS: Nonrecursive Datalog Rewriter for Linear TGDs and Conjunctive Queries.
OTM Conferences (2)
Stanislav Kikot, Roman Kontchakov, Salvatore Rapisarda, Michael Zakharyaschev
2018 — conf
Towards a Data Complexity Classification of Ontology-Mediated Queries with Covering.
Description Logics
Michael Zakharyaschev, Stanislav Kikot, Olga Gerasimova
2017 J jnl
Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators.
CoRR
Stanislav Kikot, Ágnes Kurucz, Yoshihito Tanaka, Frank Wolter, Michael Zakharyaschev
2017 — conf
More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom.
KESW
Olga Gerasimova, Stanislav Kikot, Vladimir V. Podolskii, Michael Zakharyaschev
2017 — conf
On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom.
Description Logics
Olga Gerasimova, Stanislav Kikot, Vladimir V. Podolskii, Michael Zakharyaschev
2017 — conf
On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL.
Description Logics
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
2017 — conf
Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries.
Description Logics
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
2017 A* conf
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.
PODS
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev
2017 J jnl
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.
CoRR
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev
2016 J jnl
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity.
CoRR
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2016 J jnl
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines.
Stud Logica
Christopher Hampson, Stanislav Kikot, Ágnes Kurucz
2016 — conf
Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries.
Description Logics
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2016 J jnl
Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries.
CoRR
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2015 J jnl
A Dichotomy for Some Elementarily Generated Modal Logics.
Stud Logica
Stanislav Kikot
2015 — conf
Combined Complexity of Answering Tree-like Queries in OWL 2 QL.
Description Logics
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii
2015 J jnl
The decision problem of modal product logics with a diagonal, and faulty counter machines.
CoRR
Christopher Hampson, Stanislav Kikot, Agi Kurucz
2015 A* conf
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results.
LICS
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii
2014 B conf
Filtration Safe Operations on Frames.
Advances in Modal Logic
Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin
2014 J jnl
On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Shallow Chases.
CoRR
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2014 — conf
On the succinctness of query rewriting over shallow ontologies.
CSL-LICS
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2014 — conf
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries.
Description Logics
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii
2014 J jnl
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries.
CoRR
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii
2014 J jnl
The price of query rewriting in ontology-based data access.
Artif. Intell.
Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev
2013 J jnl
Modal definability of first-order formulas with free variables and query answering.
J. Appl. Log.
Stanislav Kikot, Evgeny Zolin
2013 — conf
Query Answering via Modal Definability with FaCT++: First Blood.
Description Logics
Stanislav Kikot, Dmitry Tsarkov, Michael Zakharyaschev, Evgeny Zolin
2013 — conf
Query Rewriting over Shallow Ontologies.
Description Logics
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2012 A* conf
Conjunctive Query Answering with OWL 2 QL.
KR
Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev
2012 J jnl
Exponential Lower Bounds and Separation for Query Rewriting
CoRR
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2012 — conf
Exponential Lower Bounds and Separation for Query Rewriting.
ICALP (2)
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2012 — conf
Long Rewritings, Short Rewritings.
Description Logics
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
2012 B conf
Sahlqvist Theorems for Precontact Logics.
Advances in Modal Logic
Philippe Balbiani, Stanislav Kikot
2011 — conf
On (In)Tractability of OBDA with OWL 2 QL.
Description Logics
Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev
2011 — conf
Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies.
RR
Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev
2010 B conf
Semantic Characterization of Kracht Formulas.
Advances in Modal Logic
Stanislav Kikot
2009 J jnl
An extension of Kracht's theorem to generalized Sahlqvist formulas.
J. Appl. Non Class. Logics
Stanislav Kikot