The complexity of one-agent refinement modal logic (extended abstract)

Authors:
Laura Bozzelli;Hans Van Ditmarsch;Sophie Pinchinat
Affiliations:
Technical University of Madrid;LORIA, CNRS, Univ. of Lorraine;IRISA, INRIA, University of Rennes
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 9
Cited 0

A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Alternation

Journal of the ACM (JACM)
Modal logic

Modal logic
Dynamic Logic

Dynamic Logic
Alternating-time temporal logic

Journal of the ACM (JACM)
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

JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the complexity of satisfiability for one-agent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of nonelementary complexity, and RML is at least doubly exponentially more succinct than ML. In this paper we show that RML-satisfiability is 'only' singly exponentially harder than ML-satisfiability, the latter being a well-known PSPACE-complete problem.