Dmitry Shkatov

Orcid: 0000-0002-0559-1503

According to our database1, Dmitry Shkatov authored at least 41 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Extensions of Solovay's system S without independent sets of axioms.
Ann. Pure Appl. Log., January, 2024

2023
Complexity function and complexity of validity of modal and superintuitionistic propositional logics.
J. Log. Comput., October, 2023

Complexity of the Universal Theory of Residuated Ordered Groupoids.
J. Log. Lang. Inf., August, 2023

Algorithmic properties of QK4.3 and QS4.3.
CoRR, 2023

2022
Complexity of finite-variable fragments of propositional temporal and modal logics of computation.
Theor. Comput. Sci., 2022

Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Stud Logica, 2022

On Independent Axiomatizability of Quasi-Normal Modal Logics.
Stud Logica, 2022

Complexity of finite-variable fragments of products with non-transitive modal logics.
J. Log. Comput., 2022

Undecidability of the Logic of Partial Quasiary Predicates.
Log. J. IGPL, 2022

2021
Correction to: Complexity of the Universal Theory of Modal Algebras.
Stud Logica, 2021

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages.
J. Log. Comput., 2021

Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages.
J. Log. Comput., 2021

Complexity of finite-variable fragments of products with K.
J. Log. Comput., 2021

Computational complexity for bounded distributive lattices with negation.
Ann. Pure Appl. Log., 2021

2020
Complexity of the Universal Theory of Modal Algebras.
Stud Logica, 2020

Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages.
J. Log. Comput., 2020

Recursive enumerability and elementary frame definability in predicate modal logic.
J. Log. Comput., 2020

Computational properties of the logic of partial quasiary predicates.
Proceedings of the SAICSIT '20: Conference of the South African Institute of Computer Scientists and Information Technologists 2020, 2020

Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages.
Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Stud Logica, 2019

Complexity of finite-variable fragments of propositional modal logics of symmetric frames.
Log. J. IGPL, 2019

Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids.
CoRR, 2019

Trakhtenbrot theorem for classical languages with three individual variables.
Proceedings of the South African Institute of Computer Scientists and Information Technologists, 2019

2018
Complexity and expressivity of propositional dynamic logics with finitely many variables.
Log. J. IGPL, 2018

On complexity of propositional linear-time temporal logic with finitely many variables.
Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists, 2018

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames.
Proceedings of the Advances in Modal Logic 12, 2018

2013
Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge.
Log. J. IGPL, 2013

2012
Modal logics for reasoning about infinite unions and intersections of binary relations.
J. Appl. Non Class. Logics, 2012

Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge.
CoRR, 2012

2011
Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information.
Proceedings of the Computational Logic in Multi-Agent Systems, 2011

2010
Finding Uniform Strategies for Multi-agent Systems.
Proceedings of the Computational Logic in Multi-Agent Systems, 11th International Workshop, 2010

2009
Tableau-based decision procedures for logics of strategic ability in multiagent systems.
ACM Trans. Comput. Log., 2009

Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis.
Proceedings of the 6th Workshop on Methods for Modalities, 2009

Tableau-based Decision Procedure for the Full Coalitional Multiagent Logic of Branching Time.
Proceedings of the Second Multi-Agent Logics, 2009

Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Tableau-based decision procedures for logics of strategic ability in multi-agent systems
CoRR, 2008

Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

2006
A general method for proving decidability of intuitionistic modal logics.
J. Appl. Log., 2006

Logics with an existential modality.
Proceedings of the Advances in Modal Logic 6, 2006


  Loading...