The Complexity of One-Agent Refinement Modal Logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

The Complexity of One-Agent Refinement Modal Logic

Résumé

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.
Fichier non déposé

Dates et versions

hal-01098744 , version 1 (29-12-2014)

Identifiants

  • HAL Id : hal-01098744 , version 1

Citer

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⟩
130 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More