Stanislav Kikot

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 36

Top Topics

Query Rewriting

Bounded Treewidth

Data Complexity

Top Venues

Description Logics

Advances in Modal Logic

Publications

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