Dmitry Shkatov

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 34

Top Topics

Computational Properties

Expressive Power

Inference Rules

Top Venues

J. Log. Comput.

Publications

Igor Gorbunov, Dmitry Shkatov
Extensions of Solovay's system S without independent sets of axioms. Ann. Pure Appl. Log. 175 (Issue 1, Part A) (2024)
Dmitry Shkatov, Clint J. van Alten
Complexity of the Universal Theory of Residuated Ordered Groupoids. J. Log. Lang. Inf. 32 (3) (2023)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity function and complexity of validity of modal and superintuitionistic propositional logics. J. Log. Comput. 33 (7) (2023)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of QK4.3 and QS4.3. CoRR (2023)
Mikhail N. Rybakov, Dmitry Shkatov
Undecidability of the Logic of Partial Quasiary Predicates. Log. J. IGPL 30 (3) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. Stud Logica 110 (2) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of propositional temporal and modal logics of computation. Theor. Comput. Sci. 925 (2022)
Igor Gorbunov, Dmitry Shkatov
On Independent Axiomatizability of Quasi-Normal Modal Logics. Stud Logica 110 (5) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of products with non-transitive modal logics. J. Log. Comput. 32 (5) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. CoRR (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages. J. Log. Comput. 31 (2) (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of products with K. J. Log. Comput. 31 (2) (2021)
Dmitry Shkatov, Clint J. van Alten
Correction to: Complexity of the Universal Theory of Modal Algebras. Stud Logica 109 (5) (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. J. Log. Comput. 31 (5) (2021)
Dmitry Shkatov, Clint J. van Alten
Computational complexity for bounded distributive lattices with negation. Ann. Pure Appl. Log. 172 (7) (2021)
Dmitry Shkatov, Clint J. van Alten
Complexity of the Universal Theory of Modal Algebras. Stud Logica 108 (2) (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. J. Log. Comput. 30 (7) (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages. AiML (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Recursive enumerability and elementary frame definability in predicate modal logic. J. Log. Comput. 30 (2) (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Computational properties of the logic of partial quasiary predicates. SAICSIT (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Recursive enumerability and elementary frame definability in predicate modal logic. CoRR (2019)
Dmitry Shkatov, Clint J. van Alten
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids. CoRR (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. Stud Logica 107 (4) (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. CoRR (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. Log. J. IGPL 27 (1) (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Trakhtenbrot theorem for classical languages with three individual variables. SAICSIT (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and expressivity of propositional dynamic logics with finitely many variables. CoRR (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. ICTAC (2018)
Mikhail N. Rybakov, Dmitry Shkatov
A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames. Advances in Modal Logic (2018)
Mikhail N. Rybakov, Dmitry Shkatov
On complexity of propositional linear-time temporal logic with finitely many variables. SAICSIT (2018)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and expressivity of propositional dynamic logics with finitely many variables. Log. J. IGPL 26 (5) (2018)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. CoRR (2018)
Mikhail N. Rybakov, Dmitry Shkatov
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter. CoRR (2017)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of propositional Linear-time Temporal Logic with finitely many variables. CoRR (2017)
Mai Ajspur, Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge. Log. J. IGPL 21 (3) (2013)
Mai Ajspur, Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge. CoRR (2012)
Natasha Alechina, Philippe Balbiani, Dmitry Shkatov
Modal logics for reasoning about infinite unions and intersections of binary relations. J. Appl. Non Class. Logics 22 (4) (2012)
Jan Calta, Dmitry Shkatov
Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information. CLIMA (2011)
Valentin Goranko, Angelo Kyrilov, Dmitry Shkatov
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis. Electron. Notes Theor. Comput. Sci. 262 (2010)
Jan Calta, Dmitry Shkatov, Bernd-Holger Schlingloff
Finding Uniform Strategies for Multi-agent Systems. CLIMA (2010)
Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time. AAMAS (2) (2009)
Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedures for logics of strategic ability in multiagent systems. ACM Trans. Comput. Log. 11 (1) (2009)
Valentin Goranko, Dmitry Shkatov
Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic. LFCS (2009)
Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time CoRR (2009)
Valentin Goranko, Dmitry Shkatov
Tableau-based Decision Procedure for the Full Coalitional Multiagent Logic of Branching Time. MALLOW (2009)
Valentin Goranko, Dmitry Shkatov
Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic CoRR (2009)
Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge CoRR (2008)
Valentin Goranko, Dmitry Shkatov
Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge. SEFM (2008)
Valentin Goranko, Dmitry Shkatov
Tableau-based decision procedures for logics of strategic ability in multi-agent systems CoRR (2008)
Natasha Alechina, Dmitry Shkatov
Logics with an existential modality. Advances in Modal Logic (2006)
Natasha Alechina, Dmitry Shkatov
A general method for proving decidability of intuitionistic modal logics. J. Appl. Log. 4 (3) (2006)