Coalition and Group Announcement Logic
Abstract
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition Announcement Logic. They allow us to reason about what groups of agents can achieve through joint announcements in non-competitive and competitive environments. In this paper, we consider a combination of these logics -- Coalition and Relativised Group Announcement Logic and provide its complete axiomatisation. Moreover, we partially answer the question of how group and coalition announcement operators interact, and settle some other open problems.
Cite
@article{arxiv.1810.02769,
title = {Coalition and Group Announcement Logic},
author = {Rustam Galimullin and Natasha Alechina},
journal= {arXiv preprint arXiv:1810.02769},
year = {2018}
}
Comments
This is a corrected version of arXiv:1707.08746v1, which appeared in Proceedings TARK 2017