2017/07/27 by Rustam Galimullin, Natasha Alechina · 1 citation
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.251.15
published as EPTCS 251, 2017, pp. 207-220 · In Proceedings TARK 2017, arXiv:1707.08250
arxiv created 2017/07/27 · arxiv updated 2017/07/28
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 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.