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 non-elementary
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.
https://hal.inria.fr/hal-01098744
Contributor : Sophie Pinchinat <>
Submitted on : Monday, December 29, 2014 - 10:02:49 AM Last modification on : Tuesday, June 15, 2021 - 4:26:36 PM
Laura Bozzelli, Hans P. Van Ditmarsch, Sophie Pinchinat. The Complexity of One-Agent Refinement Modal Logic. IJCAI 2013 - 23rd International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. ⟨hal-01098744⟩