Coalition announcements

Coalition announcement logic is one of the family of logics of quantified announcements. It extends public announcement logic with formulas 〈[G]〉φ that are read as ‘there is a truthful public announcement by agents from G such that whatever agents from A \G announce at the same time, φ holds after the joint announcement.’ The logic has enjoyed comparatively less attention than its siblings — arbitrary and group announcement logics. The reason for such a situation can be partially attributed to the inherent alternation of quantification in coalition announcements. To deal with the problem, we consider relativised group announcements that separate the coalition’s announcement from the anti-coalition’s response. We present coalition and relativised group announcement logic and show its completeness. Apart from that, we prove that the complexity of the modelchecking problem for coalition announcement logic is PSPACE-complete in the general case, and in P in a special case of positive target formulas. We also study relative expressivity of logics of quantified announcements. In particular we show that arbitrary and coalition announcement logics are not at least as expressive as group announcement logic. Finally, we present a counter-example to the proposed definition of coalition announcements in terms of group announcements, and consider some other interesting properties.

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

[2]  Carsten Lutz,et al.  Complexity and succinctness of public announcement logic , 2006, AAMAS '06.

[3]  Wiebe van der Hoek,et al.  Fully Arbitrary Public Announcements , 2016, Advances in Modal Logic.

[4]  J. Armstrong.  Knowledge and Belief , 1953 .

[5]  van der Hoek,et al.  Semantic Results for Ontic and Epistemic Change , 2008 .

[6]  Tiago De Lima,et al.  Alternating-time temporal dynamic epistemic logic , 2014, J. Log. Comput..

[7]  Bernhard Nebel,et al.  Cooperative Epistemic Multi-Agent Planning for Implicit Coordination , 2017, M4M@ICLA.

[8]  Yanjing Wang,et al.  On axiomatizations of public announcement logic , 2013, Synthese.

[9]  Joshua Sack,et al.  Logics of temporal-epistemic actions , 2015, Synthese.

[10]  Eric Pacuit,et al.  Neighborhood Semantics for Modal Logic , 2017 .

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

[12]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[13]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[14]  Louwe B. Kuijer.  Arbitrary Arrow Update Logic with Common Knowledge is neither RE nor co-RE , 2017, TARK.

[15]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

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

[17]  Wiebe van der Hoek,et al.  On the succinctness of some modal logics , 2013, Artif. Intell..

[18]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[19]  Tomohiro Hoshi,et al.  Merging DEL and ETL , 2010, J. Log. Lang. Inf..

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

[21]  Guillaume Aucher,et al.  Dynamic epistemic logic in update logic , 2016, J. Log. Comput..

[22]  Natasha Alechina,et al.  Coalition and Group Announcement Logic , 2017, TARK.

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