| Product-free Lambek calculus is NP-complete Y Savateev International Symposium on Logical Foundations of Computer Science, 380-394, 2009 | 31 | 2009 |
| Non-well-founded proofs for the Grzegorczyk modal logic Y Savateev, D Shamkanov The Review of Symbolic Logic 14 (1), 22-50, 2021 | 16 | 2021 |
| Product-free Lambek calculus is NP-complete Y Savateev Annals of Pure and Applied Logic 163 (7), 775-788, 2012 | 15 | 2012 |
| Unidirectional Lambek grammars in polynomial time Y Savateev Theory of Computing Systems 46 (4), 662-672, 2010 | 15 | 2010 |
| Lambek grammars with one division are decidable in polynomial time Y Savateev International Computer Science Symposium in Russia, 273-282, 2008 | 13 | 2008 |
| Unique characterisability and learnability of temporal instance queries M Fortin, B Konev, V Ryzhikov, Y Savateev, F Wolter, M Zakharyaschev arXiv preprint arXiv:2205.01651, 2022 | 10 | 2022 |
| Deciding FO-rewritability of ontology-mediated queries in linear temporal logic V Ryzhikov, Y Savateev, M Zakharyaschev 28th International Symposium on Temporal Representation and Reasoning (TIME …, 2021 | 5 | 2021 |
| The derivability problem for Lambek calculus with one division Y Savateev Artificial Intelligence Preprint Series 56, 2006 | 5 | 2006 |
| Cut elimination for the weak modal Grzegorczyk logic via non-well-founded proofs Y Savateev, D Shamkanov Logic, Language, Information, and Computation: 26th International Workshop …, 2019 | 4 | 2019 |
| Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs Y Savateev, D Shamkanov International Workshop on Logic, Language, Information, and Computation, 321-335, 2017 | 4 | 2017 |
| Reverse engineering of temporal queries mediated by LTL ontologies M Fontin, B Konev, V Ryzhikov, Y Savateev, F Wolter, M Zakharyaschev arXiv preprint arXiv:2305.01248, 2023 | 3 | 2023 |
| ESPRESSO: A Framework for Empowering Search on Decentralized Web M Ragab, Y Savateev, R Moosaei, T Tiropanis, A Poulovassilis, ... International Conference on Web Information Systems Engineering, 360-375, 2023 | 2 | 2023 |
| Deciding fo-rewritability of regular languages and ontology-mediated queries in linear temporal logic A Kurucz, V Ryzhikov, Y Savateev, M Zakharyaschev Journal of Artificial Intelligence Research 76, 645-703, 2023 | 1 | 2023 |
| Reverse engineering of temporal queries with and without LTL ontologies: First steps M Fortin, B Konev, V Ryzhikov, Y Savateev, F Wolter, M Zakharyaschev Description Logics, 2022 | 1 | 2022 |
| Deciding FO-definability of regular languages A Kurucz, V Ryzhikov, Y Savateev, M Zakharyaschev International Conference on Relational and Algebraic Methods in Computer …, 2021 | 1 | 2021 |
| Proof internalization in generalized Frege systems for classical logic Y Savateev Annals of Pure and Applied Logic 165 (1), 340-356, 2014 | 1 | 2014 |
| DESERE: The 1st Workshop on Decentralised Search and Recommendation M Ragab, Y Savateev, W Wang, R Moosaei, T Tiropanis, A Poulovassilis, ... arXiv preprint arXiv:2403.07732, 2024 | | 2024 |
| ESPRESSO: a framework for empowering search on decentralized web MRM Mohamed, T Tiropanis, A Chapman, Y Savateev, G Russos, ... | | 2023 |
| The Symposium on Logical Foundations of Computer Science 2009 A Nerode, J Worthington, K Tadaki, Y Savateev, W Moczydłowski, ... Elsevier, 2012 | | 2012 |
| Sequent Calculus for Justifications. Y Savateev TABLEAUX (Workshops, Tutorials, and Short Papers), 74, 2011 | | 2011 |
