Complexity of logics for multi-agent systems with restricted modal context
Marcin Dziubiński · Logic Journal of IGPL · 2011
We present a modal context restriction for multimodal logics with iterated modalities combining axioms K, D, 5 and 45, for which the satisfiability problem is PSPACE-complete and putting additional restriction on the modal depth of formulas makes it NPTIME-complete. We propose an extension of the tableau method, as presented in [9], for checking the satisfiability of the formulas with restricted modal context. The case of axiom T is also discussed.