Dmitry Shkatov

发表

Complexity of the Universal Theory of Modal Algebras

Clint J. van Alten, Dmitry Shkatov, 2020, Stud Logica.

A general method for proving decidability of intuitionistic modal logics

Natasha Alechina, Dmitry Shkatov, N. Alechina, 2006, J. Appl. Log..

Tableau-based Decision Procedure for the Full Coalitional Multiagent Logic of Branching Time

Valentin Goranko, Dmitry Shkatov, V. Goranko, 2009, MALLOW.

Recursive enumerability and elementary frame definability in predicate modal logic pdf

Dmitry Shkatov, Mikhail Rybakov, 2020, J. Log. Comput..

A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames

Dmitry Shkatov, Mikhail N. Rybakov, D. Shkatov, 2018, Advances in Modal Logic.

Complexity of finite-variable fragments of products with K

Dmitry Shkatov, Mikhail Rybakov, D. Shkatov, 2020, J. Log. Comput..

Logics with an existential modality

Natasha Alechina, Dmitry Shkatov, N. Alechina, 2006, Advances in Modal Logic.

Complexity and expressivity of propositional dynamic logics with finitely many variables

Dmitry Shkatov, Mikhail N. Rybakov, 2018, Log. J. IGPL.

Trakhtenbrot theorem for classical languages with three individual variables

Dmitry Shkatov, Mikhail Rybakov, 2019, SAICSIT '19.

Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information

Dmitry Shkatov, Jan Calta, 2011, CLIMA.

Tableau-based decision procedures for logics of strategic ability in multiagent systems

Valentin Goranko, Dmitry Shkatov, V. Goranko, 2008, TOCL.

Complexity of finite-variable fragments of propositional modal logics of symmetric frames

Dmitry Shkatov, Mikhail N. Rybakov, D. Shkatov, 2018, Log. J. IGPL.

On complexity of propositional linear-time temporal logic with finitely many variables

Dmitry Shkatov, Mikhail N. Rybakov, D. Shkatov, 2017, SAICSIT.

Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge

Valentin Goranko, Dmitry Shkatov, V. Goranko, 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.

Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge pdf

Valentin Goranko, Dmitry Shkatov, Mai Ajspur, 2012, Log. J. IGPL.

Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic

Valentin Goranko, Dmitry Shkatov, 2009, LFCS.

Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids pdf

Dmitry Shkatov, C. J. Van Alten, C. V. Alten, 2019, Algebra universalis.

Finding Uniform Strategies for Multi-agent Systems

Holger Schlingloff, Dmitry Shkatov, Jan Calta, 2010, CLIMA.

Computational properties of the logic of partial quasiary predicates

Dmitry Shkatov, Mikhail Rybakov, D. Shkatov, 2020, SAICSIT.

Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time

Valentin Goranko, Dmitry Shkatov, V. Goranko, 2009, AAMAS.

Tableau-based decision procedure

Valentin Goranko, Dmitry Shkatov, Mai Ajspur, 2012 .

Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter

Dmitry Shkatov, Mikhail N. Rybakov, D. Shkatov, 2017, Stud Logica.

Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis

Valentin Goranko, Angelo Kyrilov, Dmitry Shkatov, 2010, M4M.

Modal logics for reasoning about infinite unions and intersections of binary relations

Natasha Alechina, Philippe Balbiani, Dmitry Shkatov, 2012, J. Appl. Non Class. Logics.

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

Dmitry Shkatov, Mikhail N. Rybakov, D. Shkatov, 2018, ICTAC.

Undecidability of the Logic of Partial Quasiary Predicates

Dmitry Shkatov, Mikhail Rybakov, D. Shkatov, 2021, Log. J. IGPL.

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

Dmitry Shkatov, Mikhail Rybakov, D. Shkatov, 2021, J. Log. Comput..

Computational complexity for bounded distributive lattices with negation

Clint J. van Alten, Dmitry Shkatov, D. Shkatov, 2021, Ann. Pure Appl. Log..

Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages

Dmitry Shkatov, Mikhail N. Rybakov, D. Shkatov, 2021, J. Log. Comput..

Correction to: Complexity of the Universal Theory of Modal Algebras

Clint J. van Alten, Dmitry Shkatov, 2021, Stud Logica.

On Decidability of Intuitionistic Modal Logics

Natasha Alechina, Dmitry Shkatov, 2004 .