no code implementations • 5 Oct 2023 • Pablo Barcelo, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir Podolskii
We contribute to the study of formal languages that can be recognized by transformer encoders.
no code implementations • 7 Jun 2020 • Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii, Michael Zakharyaschev
In this article, aiming to understand the fundamental roots of this difficulty, we strip the problem to the bare bones and focus on Boolean conjunctive queries mediated by a simple covering axiom stating that one class is covered by the union of two other classes.
1 code implementation • 31 Dec 2018 • Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir Podolskii
As a simple application of the presented linear-size construction, we show how to multiply two $n\times n$ matrices over an arbitrary semiring in $O(n^2)$ time if one of these matrices is a 0/1-matrix with $O(n)$ zeroes (i. e., a complement of a sparse matrix).
Computational Complexity
no code implementations • 4 May 2016 • Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Michael Zakharyaschev
We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering.
no code implementations • 11 Jun 2014 • Meghyn Bienvenu, Stanislav Kikot, Vladimir Podolskii
Our first contribution is to clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries to bounded treewidth queries.