ML Anthology

The Complexity of One-Agent Refinement Modal Logic

Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
IJCAI 2013 pp. 2977-2981
/ijcai/2013/bozzelli2013ijcai-complexity/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Bozzelli et al. "The Complexity of One-Agent Refinement Modal Logic." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Bozzelli et al. "The Complexity of One-Agent Refinement Modal Logic." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/bozzelli2013ijcai-complexity/)

BibTeX

@inproceedings{bozzelli2013ijcai-complexity,
  title     = {{The Complexity of One-Agent Refinement Modal Logic}},
  author    = {Bozzelli, Laura and van Ditmarsch, Hans and Pinchinat, Sophie},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {2977-2981},
  url       = {https://mlanthology.org/ijcai/2013/bozzelli2013ijcai-complexity/}
}