Year: 2025
Type: article
Abstract: We prove that for weakly transitive modal logics equipped with the universal modality whose satisfiability problem is already decidable in PSPACE, adding the connectivity axiom does not increase the complexity. Moreover, we present an algorithm that solves the satisfiability task within the same complexity class.
Authors: K. M. Myasnikov, A. V. Kudinov
Institution: Moscow Institute of Physics and Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4412674365