Abstract

Coalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.

Highlights

  • In the multi-agent logic of knowledge we investigate what agents know about their factual environment and what they know about knowledge of each other (Hintikka 1962). (Truthful) Public announcement logic (PAL) is an extension of the multi-agent

  • We have shown that the model checking problem for Coalition announcement logic (CAL) is PSPACE-complete, just like the one for GAL (Ågotnes et al 2010) and APAL (Balbiani et al 2008)

  • We presented a model checker for both CAL and GAL formulas

Read more

Summary

Introduction

In the multi-agent logic of knowledge we investigate what agents know about their factual environment and what they know about knowledge of each other (Hintikka 1962). (Truthful) Public announcement logic (PAL) is an extension of the multi-agent. In Ågotnes and van Ditmarsch (2008) the authors propose two generalisations of public announcement logic, GAL (group announcement logic) and CAL (coalition announcement logic). CAL has been far less investigated than other logics of quantified announcements, such as APAL (Balbiani et al 2008) and GAL, some combined results have been achieved (Ågotnes et al 2016; French et al 2019; van Ditmarsch et al 2021). 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 contains a large worked example. The implementation and its performance are described in detail in Wang (2019), and briefly in Sect. 5 of this paper

Introductory Example
Syntax and Semantics of CAL
Bisimulation
Distinguishing Formulas
Strategies
Model Checking for CAL
General Case
Positive Case
Implementation and Experimental Results
Households and Burglars
Experiments
Concluding Remarks
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call