A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
Modal logic
Dynamic Logic
Alternating-time temporal logic
Journal of the ACM (JACM)
Verification of Fair Transisiton Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Simulation and Information: Quantifying over Epistemic Events
Knowledge Representation for Agents and Multi-Agent Systems
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A generic constructive solution for concurrent games with expressive constraints on strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
The complexity of one-agent refinement modal logic (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Arbitrary Action Model Logic and Action Model Synthesis
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We investigate the complexity of satisfiability for one-agent Refinement Modal Logic ($\text{\sffamily RML}$), a known extension of basic modal logic ($\text{\sffamily ML}$) obtained by adding refinement quantifiers on structures. It is known that $\text{\sffamily RML}$ has the same expressiveness as $\text{\sffamily ML}$, but the translation of $\text{\sffamily RML}$ into $\text{\sffamily ML}$ is of non-elementary complexity, and $\text{\sffamily RML}$ is at least doubly exponentially more succinct than $\text{\sffamily ML}$. In this paper, we show that $\text{\sffamily RML}$-satisfiability is 'only' singly exponentially harder than $\text{\sffamily ML}$-satisfiability, the latter being a well-known PSPACE-complete problem. More precisely, we establish that $\text{\sffamily RML}$-satisfiability is complete for the complexity class AEXP$_{\text{\sffamily pol}}$, i.e., the class of problems solvable by alternating Turing machines running in single exponential time but only with a polynomial number of alternations (note that NEXPTIME⊆ AEXP$_{\text{\sffamily pol}}$⊆ EXPSPACE).