default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanislav Kikot
Person information
- affiliation: Birkbeck College, London
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and the Analysis of Queries, Views, and Rules. KR 2024- [i14]Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and the Analysis of Queries, Views, and Rules. CoRR abs/2407.14907 (2024) - 2023
- [j11]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): 16:1-16:62 (2023) - [i13]Stanislav Kikot:
Spatial Intelligence of a Self-driving Car and Rule-Based Decision Making. CoRR abs/2308.01085 (2023) - 2022
- [j10]Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev:
A tetrachotomy of ontology-mediated queries with a covering axiom. Artif. Intell. 309: 103738 (2022) - 2021
- [c30]Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev:
Deciding Boundedness of Monadic Sirups. PODS 2021: 370-387 - [i12]Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev:
Deciding boundedness of monadic sirups. CoRR abs/2108.00433 (2021) - 2020
- [j9]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): 102786 (2020) - [c29]Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin:
Modal Logics with Transitive Closure: Completeness, Decidability, Filtration. AiML 2020: 369-388 - [c28]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: 403-413 - [c27]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. PODS 2020: 131-148 - [i11]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On monotonic determinacy and rewritability for recursive queries and views. CoRR abs/2003.05898 (2020) - [i10]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 abs/2006.04167 (2020)
2010 – 2019
- 2019
- [j8]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): 533-588 (2019) - [c26]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: 329-351 - [i9]Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino:
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. CoRR abs/1905.09536 (2019) - 2018
- [j7]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): 28:1-28:51 (2018) - [c25]Stanislav Kikot:
Kripke Completeness of Strictly Positive Modal Logics Over Meet Semi-Lattices with Operators. Advances in Modal Logic 2018: 9 - [c24]Stanislav Kikot, Agi Kurucz, Frank Wolter, Michael Zakharyaschev:
On Strictly Positive Modal Logics with S4.3 Frames. Advances in Modal Logic 2018: 427-446 - [c23]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 - [c22]Michael Zakharyaschev, Stanislav Kikot, Olga Gerasimova:
Towards a Data Complexity Classification of Ontology-Mediated Queries with Covering. Description Logics 2018 - [c21]Stanislav Kikot, Roman Kontchakov, Salvatore Rapisarda, Michael Zakharyaschev:
STypeS: Nonrecursive Datalog Rewriter for Linear TGDs and Conjunctive Queries. OTM Conferences (2) 2018: 441-460 - 2017
- [c20]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 - [c19]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 - [c18]Olga Gerasimova, Stanislav Kikot, Vladimir V. Podolskii, Michael Zakharyaschev:
On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom. Description Logics 2017 - [c17]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: 143-158 - [c16]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: 201-216 - [i8]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 abs/1702.03358 (2017) - [i7]Stanislav Kikot, Ágnes Kurucz, Yoshihito Tanaka, Frank Wolter, Michael Zakharyaschev:
Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators. CoRR abs/1708.03403 (2017) - 2016
- [j6]Christopher Hampson, Stanislav Kikot, Ágnes Kurucz:
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines. Stud Logica 104(3): 455-486 (2016) - [c15]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 - [i6]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries. CoRR abs/1604.05258 (2016) - [i5]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. CoRR abs/1605.01207 (2016) - 2015
- [j5]Stanislav Kikot:
A Dichotomy for Some Elementarily Generated Modal Logics. Stud Logica 103(5): 1063-1093 (2015) - [c14]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Combined Complexity of Answering Tree-like Queries in OWL 2 QL. Description Logics 2015 - [c13]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. LICS 2015: 317-328 - [i4]Christopher Hampson, Stanislav Kikot, Agi Kurucz:
The decision problem of modal product logics with a diagonal, and faulty counter machines. CoRR abs/1509.02060 (2015) - 2014
- [j4]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: 42-59 (2014) - [c12]Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin:
Filtration Safe Operations on Frames. Advances in Modal Logic 2014: 333-352 - [c11]Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
On the succinctness of query rewriting over shallow ontologies. CSL-LICS 2014: 57:1-57:10 - [c10]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. Description Logics 2014: 45-57 - [i3]Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Shallow Chases. CoRR abs/1401.4420 (2014) - [i2]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. CoRR abs/1406.3047 (2014) - 2013
- [j3]Stanislav Kikot, Evgeny Zolin:
Modal definability of first-order formulas with free variables and query answering. J. Appl. Log. 11(2): 190-216 (2013) - [c9]Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Query Rewriting over Shallow Ontologies. Description Logics 2013: 316-327 - [c8]Stanislav Kikot, Dmitry Tsarkov, Michael Zakharyaschev, Evgeny Zolin:
Query Answering via Modal Definability with FaCT++: First Blood. Description Logics 2013: 328-340 - 2012
- [c7]Philippe Balbiani, Stanislav Kikot:
Sahlqvist Theorems for Precontact Logics. Advances in Modal Logic 2012: 55-70 - [c6]Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Long Rewritings, Short Rewritings. Description Logics 2012 - [c5]Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Exponential Lower Bounds and Separation for Query Rewriting. ICALP (2) 2012: 263-274 - [c4]Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev:
Conjunctive Query Answering with OWL 2 QL. KR 2012 - [i1]Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Exponential Lower Bounds and Separation for Query Rewriting. CoRR abs/1202.4193 (2012) - 2011
- [c3]Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev:
On (In)Tractability of OBDA with OWL 2 QL. Description Logics 2011 - [c2]Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev:
Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies. RR 2011: 124-138 - 2010
- [j2]Stanislav Kikot:
Relation Algebras by Games, by Robin Hirsch and Ian Hodkinson. J. Log. Comput. 20(2): 645-648 (2010) - [c1]Stanislav Kikot:
Semantic Characterization of Kracht Formulas. Advances in Modal Logic 2010: 218-234
2000 – 2009
- 2009
- [j1]Stanislav Kikot:
An extension of Kracht's theorem to generalized Sahlqvist formulas. J. Appl. Non Class. Logics 19(2): 227-251 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 00:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
