dc.contributor.author | Alechina, Natasha | |
dc.contributor.author | van Ditmarsch, Hans | |
dc.contributor.author | Galimullin, Rustam | |
dc.contributor.author | Wang, Tuo | |
dc.date.accessioned | 2022-04-04T09:21:57Z | |
dc.date.available | 2022-04-04T09:21:57Z | |
dc.date.created | 2021-11-30T16:56:00Z | |
dc.date.issued | 2021 | |
dc.identifier.issn | 0925-8531 | |
dc.identifier.uri | https://hdl.handle.net/11250/2989478 | |
dc.description.abstract | Coalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.relation.uri | https://rgalimullin.gitlab.io/JOLLI21/MCCALpaper%20draft.pdf | |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Verification and Strategy Synthesis for Coalition Announcement Logic | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2021 The Author(s) | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.1007/s10849-021-09339-6 | |
dc.identifier.cristin | 1962029 | |
dc.source.journal | Journal of Logic, Language and Information | en_US |
dc.source.pagenumber | 671-700 | en_US |
dc.identifier.citation | Journal of Logic, Language and Information. 2021, 30 (4), 671-700. | en_US |
dc.source.volume | 30 | en_US |
dc.source.issue | 4 | en_US |