Skip to content
naulon
Not checkedNot checked for notices yet.

Coalition and Group Announcement Logic

Rustam Galimullin, Natasha Alechina

Electronic Proceedings in Theoretical Computer Science · 2017

doi:10.4204/eptcs.251.15 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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 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.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.