Group Announcement Logic with Distributed Knowledge

Public announcement logic (PAL) is an extension of epistemic logic with dynamic operators that model the effects of all agents simultaneously and publicly acquiring the same piece of information. One of the extensions of PAL, group announcement logic (GAL), allows quantification over (possibly joint) announcements made by agents. In GAL, it is possible to reason about what groups can achieve by making such announcements. It seems intuitive that this notion of coalitional ability should be closely related to the notion of distributed knowledge, the implicit knowledge of a group. Thus, we study the extension of GAL with distributed knowledge, and in particular possible interaction properties between GAL operators and distributed knowledge. The perhaps surprising result is that there in fact are no interaction properties, contrary to intuition. We make this claim precise by providing a sound and complete axiomatisation of GAL with distributed knowledge.

[1]  J. Benthem,et al.  Logics of communication and change , 2006 .

[2]  John-Jules Ch. Meyer,et al.  Making Some Issues of Implicit Knowledge Explicit , 1992, Int. J. Found. Comput. Sci..

[3]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[4]  Hans van Ditmarsch,et al.  What will they say?—Public Announcement Games , 2011, Synthese.

[5]  Natasha Alechina,et al.  Groups Versus Coalitions: On the Relative Expressivity of GAL and CAL , 2019, AAMAS.

[6]  Natasha Alechina,et al.  Model Checking for Coalition Announcement Logic , 2018, KI.

[7]  Jan A. Plaza,et al.  Logics of public communications , 2007, Synthese.

[8]  Yì N. Wáng,et al.  Relativized common knowledge for dynamic epistemic logic , 2015, J. Appl. Log..

[9]  Sophie Pinchinat,et al.  Refinement modal logic , 2012, Inf. Comput..

[10]  Yì N. Wáng,et al.  Resolving distributed knowledge , 2017, Artif. Intell..

[11]  Valentin Goranko,et al.  Model theory of modal logic , 2007, Handbook of Modal Logic.

[12]  Yì N. Wáng,et al.  Public announcement logic with distributed knowledge: expressivity, completeness and complexity , 2013, Synthese.

[13]  James Hales,et al.  Arbitrary Action Model Logic and Action Model Synthesis , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[14]  Philippe Balbiani,et al.  Group announcement logic , 2010, J. Appl. Log..

[15]  Barteld Kooi,et al.  Dynamic Epistemic Logic , 2013 .

[16]  Robert Goldblatt,et al.  Axiomatising the Logic of Computer Programming , 1982, Lecture Notes in Computer Science.

[17]  Hans van Ditmarsch,et al.  Coalitions and announcements , 2008, AAMAS.

[18]  Hans van Ditmarsch,et al.  The Secret of My Success , 2006, Synthese.

[19]  Barteld Kooi,et al.  Arbitrary arrow update logic , 2017, Artif. Intell..

[20]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

[21]  Andreas Herzig,et al.  ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ , 2008, The Review of Symbolic Logic.