Stanislav Kikot

According to our database, Stanislav Kikot authored at least 43 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Monotone Rewritability and the Analysis of Queries, Views, and Rules.

Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

2023

On Monotonic Determinacy and Rewritability for Recursive Queries and Views.

Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero

ACM Trans. Comput. Log., April, 2023

Spatial Intelligence of a Self-driving Car and Rule-Based Decision Making.

Stanislav Kikot

CoRR, 2023

2022

A tetrachotomy of ontology-mediated queries with a covering axiom.

Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev

Artif. Intell., 2022

2021

Deciding Boundedness of Monadic Sirups.

Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

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

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

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Modal Logics with Transitive Closure: Completeness, Decidability, Filtration.

Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin

Proceedings of the 13th Conference on Advances in Modal Logic, 2020

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

Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Polyanna.

Olga Gerasimova, Stanislav Kikot, Michael Zakharyaschev

Proceedings of the Description Logic, Theory Combination, and All That, 2019

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

STypeS: Nonrecursive Datalog Rewriter for Linear TGDs and Conjunctive Queries.

Stanislav Kikot, Roman Kontchakov, Salvatore Rapisarda, Michael Zakharyaschev

Proceedings of the On the Move to Meaningful Internet Systems. OTM 2018 Conferences, 2018

Towards a Data Complexity Classification of Ontology-Mediated Queries with Covering.

Michael Zakharyaschev, Stanislav Kikot, Olga Gerasimova

Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to, 2018

On the Data Complexity of Ontology-Mediated Queries with MTL Operators over Timed Words.

Stanislav Kikot, Vladislav Ryzhikov, Przemyslaw Andrzej Walega, Michael Zakharyaschev

Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to, 2018

On Strictly Positive Modal Logics with S4.3 Frames.

Stanislav Kikot, Agi Kurucz, Frank Wolter, Michael Zakharyaschev

Proceedings of the Advances in Modal Logic 12, 2018

Kripke Completeness of Strictly Positive Modal Logics Over Meet Semi-Lattices with Operators.

Stanislav Kikot

Proceedings of the Advances in Modal Logic 12, 2018

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

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom.

Olga Gerasimova, Stanislav Kikot, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the Knowledge Engineering and Semantic Web - 8th International Conference, 2017

On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom.

Olga Gerasimova, Stanislav Kikot, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the 30th International Workshop on 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

Proceedings of the 30th International Workshop on Description Logics, 2017

On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL.

Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev

Proceedings of the 30th International Workshop on Description Logics, 2017

2016

The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines.

Christopher Hampson, Stanislav Kikot, Ágnes Kurucz

Stud Logica, 2016

Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries.

Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the 29th International Workshop on Description Logics, 2016

2015

A Dichotomy for Some Elementarily Generated Modal Logics.

Stanislav Kikot

Stud Logica, 2015

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results.

Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Combined Complexity of Answering Tree-like Queries in OWL 2 QL.

Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii

Proceedings of the 28th International Workshop on Description Logics, 2015

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

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

Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries.

Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii

Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

On the succinctness of query rewriting over shallow ontologies.

Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Filtration Safe Operations on Frames.

Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin

Proceedings of the Advances in Modal Logic 10, 2014

2013

Modal definability of first-order formulas with free variables and query answering.

Stanislav Kikot, Evgeny Zolin

J. Appl. Log., 2013

Query Answering via Modal Definability with FaCT++: First Blood.

Stanislav Kikot, Dmitry Tsarkov, Michael Zakharyaschev, Evgeny Zolin

Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

Query Rewriting over Shallow Ontologies.

Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012

Conjunctive Query Answering with OWL 2 QL.

Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Exponential Lower Bounds and Separation for Query Rewriting.

Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Long Rewritings, Short Rewritings.

Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev

Proceedings of the 2012 International Workshop on Description Logics, 2012

Sahlqvist Theorems for Precontact Logics.

Philippe Balbiani, Stanislav Kikot

Proceedings of the Advances in Modal Logic 9, 2012

2011

Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies.

Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev

Proceedings of the Web Reasoning and Rule Systems - 5th International Conference, 2011

On (In)Tractability of OBDA with OWL 2 QL.

Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev

Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

2010

<i>Relation Algebras by Games</i>, by Robin Hirsch and Ian Hodkinson.

Stanislav Kikot

J. Log. Comput., 2010

Semantic Characterization of Kracht Formulas.

Stanislav Kikot

Proceedings of the Advances in Modal Logic 8, 2010

2009

An extension of Kracht's theorem to generalized Sahlqvist formulas.

Stanislav Kikot

J. Appl. Non Class. Logics, 2009