Logics with an existential modality. - Natasha Alechina; Dmitry Shkatov (Advances in Modal Logic, 2006)

A general method for proving decidability of intuitionistic modal logics. - Natasha Alechina; Dmitry Shkatov (J. Appl. Log., 2006)

Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge. - Valentin Goranko; Dmitry Shkatov (SEFM, 2008)

Tableau-based decision procedures for logics of strategic ability in multi-agent systems - Valentin Goranko; Dmitry Shkatov (CoRR, 2008)

Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time. - Valentin Goranko; Dmitry Shkatov (AAMAS (2), 2009)

Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic. - Valentin Goranko; Dmitry Shkatov (LFCS, 2009)

Tableau-based Decision Procedure for the Full Coalitional Multiagent Logic of Branching Time. - Valentin Goranko; Dmitry Shkatov (MALLOW, 2009)

Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis. - Valentin Goranko; Angelo Kyrilov; Dmitry Shkatov (M4M, 2009)

Tableau-based decision procedures for logics of strategic ability in multiagent systems. - Valentin Goranko; Dmitry Shkatov (ACM Trans. Comput. Log., 2009)

Finding Uniform Strategies for Multi-agent Systems. - Jan Calta; Dmitry Shkatov; Bernd-Holger Schlingloff (CLIMA, 2010)

Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information. - Jan Calta; Dmitry Shkatov (CLIMA, 2011)

Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge. - Mai Ajspur; Valentin Goranko; Dmitry Shkatov (CoRR, 2012)

Modal logics for reasoning about infinite unions and intersections of binary relations. - Natasha Alechina; Philippe Balbiani; Dmitry Shkatov (J. Appl. Non Class. Logics, 2012)

Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge. - Mai Ajspur; Valentin Goranko; Dmitry Shkatov (Log. J. IGPL, 2013)

A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames. - Mikhail N. Rybakov; Dmitry Shkatov (Advances in Modal Logic, 2018)

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. - Mikhail N. Rybakov; Dmitry Shkatov (ICTAC, 2018)

On complexity of propositional linear-time temporal logic with finitely many variables. - Mikhail N. Rybakov; Dmitry Shkatov (SAICSIT, 2018)

Complexity and expressivity of propositional dynamic logics with finitely many variables. - Mikhail N. Rybakov; Dmitry Shkatov (Log. J. IGPL, 2018)

Trakhtenbrot theorem for classical languages with three individual variables. - Mikhail N. Rybakov; Dmitry Shkatov (SAICSIT, 2019)

Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids. - Dmitry Shkatov; Clint J. van Alten (CoRR, 2019)

Complexity of finite-variable fragments of propositional modal logics of symmetric frames. - Mikhail N. Rybakov; Dmitry Shkatov (Log. J. IGPL, 2019)

Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. - Mikhail N. Rybakov; Dmitry Shkatov (Stud Logica, 2019)

Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages. - Mikhail N. Rybakov; Dmitry Shkatov (AiML, 2020)

Computational properties of the logic of partial quasiary predicates. - Mikhail N. Rybakov; Dmitry Shkatov (SAICSIT, 2020)

Recursive enumerability and elementary frame definability in predicate modal logic. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2020)

Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2020)

Complexity of the Universal Theory of Modal Algebras. - Dmitry Shkatov; Clint J. van Alten (Stud Logica, 2020)

Computational complexity for bounded distributive lattices with negation. - Dmitry Shkatov; Clint J. van Alten (Ann. Pure Appl. Log., 2021)

Complexity of finite-variable fragments of products with K. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2021)

Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2021)

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2021)

Correction to: Complexity of the Universal Theory of Modal Algebras. - Dmitry Shkatov; Clint J. van Alten (Stud Logica, 2021)

Undecidability of the Logic of Partial Quasiary Predicates. - Mikhail N. Rybakov; Dmitry Shkatov (Log. J. IGPL, 2022)

Complexity of finite-variable fragments of products with non-transitive modal logics. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2022)

On Independent Axiomatizability of Quasi-Normal Modal Logics. - Igor Gorbunov; Dmitry Shkatov (Stud Logica, 2022)

Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. - Mikhail N. Rybakov; Dmitry Shkatov (Stud Logica, 2022)

Complexity of finite-variable fragments of propositional temporal and modal logics of computation. - Mikhail N. Rybakov; Dmitry Shkatov (Theor. Comput. Sci., 2022)

Algorithmic properties of QK4.3 and QS4.3. - Mikhail N. Rybakov; Dmitry Shkatov (CoRR, 2023)

Complexity of the Universal Theory of Residuated Ordered Groupoids. - Dmitry Shkatov; Clint J. van Alten (J. Log. Lang. Inf., 2023)

Complexity function and complexity of validity of modal and superintuitionistic propositional logics. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2023)

On the System of Positive Slices in the Structure of Superintuitionistic Predicate Logics. - Mikhail N. Rybakov; Dmitry Shkatov; Dmitrij P. Skvortsov (AiML, 2024)

Extensions of Solovay's system S without independent sets of axioms. - Igor Gorbunov; Dmitry Shkatov (Ann. Pure Appl. Log., 2024)

Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2025)

Polytime embedding of intuitionistic modal logics into their one-variable fragments. - Mikhail N. Rybakov; Dmitry Shkatov (J. Log. Comput., 2025)

Variations on the Kripke Trick. - Mikhail N. Rybakov; Dmitry Shkatov (Stud Logica, 2025)