Model Checking for Coalition Announcement Logic

Abstract

Coalition Announcement Logic (CAL) studies how a group of agents can enforce a certain outcome by making a joint announcement, regardless of any announcements made simultaneously by the opponents. The logic is useful to model imperfect information games with simultaneous moves. We propose a model checking algorithm for CAL and show that the model checking problem for CAL is PSPACE-complete. We also also consider a special positive case for which the model checking problem is in P. We compare these results to those for other logics with quantification over information change.

Verification and Strategy Synthesis for Coalition Announcement Logic

“…The model checking algorithm is given in Section 4. The algorithm presented here differs from the one presented in Galimullin et al (2018) in several respects. Instead of iterating over an explicit list of strategies, it generates and tests strategies one at a time, so that it only uses polynomial space.…”

“…This paper is a revised and extended version of Galimullin et al (2018), with detailed proofs and a new section on the implementation of the model-checking algorithm, which also contains a large worked example. The structure of the paper is as follows.…”

Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power

“…Agents from G can announce characteristic formulas that describe their equivalence classes and include s, i.e. i∈G [s] i for all i ∈ G (see Galimullin et al 2018;…”