{"type":"ScholarlyArticle","title":"The Complexity of One-Agent Refinement Modal Logic","authors":[{"name":"Laura Bozzelli","slug":"laura-bozzelli","given":"Laura","family":"Bozzelli","affiliation":""},{"name":"Hans van Ditmarsch","slug":"hans-van-ditmarsch","given":"Hans","family":"van Ditmarsch","affiliation":""},{"name":"Sophie Pinchinat","slug":"sophie-pinchinat","given":"Sophie","family":"Pinchinat","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/440","pdf":"https://ijcai.org/proceedings/2013/0440.pdf","markdown":"https://ijcai.org/proceedings/2013/440.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/440","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":440,"pages":{"first":2977,"last":2980},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}