@inproceedings{d061ae5e06924fdc9b572586dc0cbbba,
title = "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 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.",
keywords = "Coalition announcement logic, Dynamic epistemic logic, Model checking",
author = "Rustam Galimullin and Natasha Alechina and {van Ditmarsch}, Hans",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 41st German Conference on Artificial Intelligence, KI 2018, KI 2018 ; Conference date: 24-09-2018 Through 28-09-2018",
year = "2018",
doi = "10.1007/978-3-030-00111-7_2",
language = "English",
isbn = "9783030001100",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "11--23",
editor = "Anni-Yasmin Turhan and Frank Trollmann",
booktitle = "KI 2018",
address = "Germany",
}