Relation-changing modal operators
We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic frame...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2015 |
| Country: | Argentina |
| Institution: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repository: | CONICET Digital (CONICET) |
| Language: | English |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/37856 |
| Online Access: | http://hdl.handle.net/11336/37856 |
| Access Level: | Open access |
| Keyword: | COMPLEXITY DYNAMIC LOGICS EXPRESSIVITY MODAL LOGIC https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Summary: | We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic framework to characterize this kind of operations. First, we investigate relation-changing modal logics as fragments of classical logics. Then, we use the new framework to get a suitable notion of bisimulation for the logics introduced, and we investigate their expressive power. Finally, we show that the complexity of the model checking problem for the particular operators introduced is PSpace-complete, and we study two subproblems of model checking: formula complexity and program complexity. |
|---|