Stanislav Kikot

From MaRDI portal
(Redirected from Person:497428)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On Monotonic Determinacy and Rewritability for Recursive Queries and Views
ACM Transactions on Computational Logic
2023-04-05Paper
scientific article; zbMATH DE number 7585723 (Why is no real title available?)2022-09-15Paper
A tetrachotomy of ontology-mediated queries with a covering axiom
Artificial Intelligence
2022-07-08Paper
Completeness of logics with the transitive closure modality and related logics2020-11-04Paper
Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna2020-06-04Paper
Kripke completeness of strictly positive modal logics over meet-semilattices with operators
Journal of Symbolic Logic
2020-04-06Paper
Kripke completeness of strictly positive modal logics over meet-semilattices with operators
Journal of Symbolic Logic
2020-04-06Paper
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
Annals of Pure and Applied Logic
2020-03-12Paper
On strictly positive modal logics with \textsf{S}4.3 frames2019-07-24Paper
Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
Journal of the ACM
2019-02-25Paper
On the succinctness of query rewriting over shallow ontologies
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)
2018-04-23Paper
On the succinctness of query rewriting over shallow ontologies
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)
2018-04-23Paper
Tree-like queries in OWL 2 QL: succinctness and complexity results
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
2018-04-23Paper
Filtration safe operations on frames2018-04-23Paper
The decision problem of modal product logics with a diagonal, and faulty counter machines
Studia Logica
2016-06-14Paper
A dichotomy for some elementarily generated modal logics
Studia Logica
2015-09-24Paper
scientific article; zbMATH DE number 6302894 (Why is no real title available?)2014-06-11Paper
The price of query rewriting in ontology-based data access
Artificial Intelligence
2014-06-10Paper
Modal definability of first-order formulas with free variables and query answering
Journal of Applied Logic
2014-04-17Paper
Exponential lower bounds and separation for query rewriting
Automata, Languages, and Programming
2012-11-01Paper
Exponential lower bounds and separation for query rewriting
Automata, Languages, and Programming
2012-11-01Paper
Semantic characterization of Kracht formulas2012-08-05Paper
An extension of Kracht's theorem to generalized Sahlqvist formulas
Journal of Applied Non-Classical Logics
2009-11-30Paper


Research outcomes over time


This page was built for person: Stanislav Kikot