Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is de-cidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiability problem for the logic is undecidable; it is co-RE complete.
|Title of host publication||Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014)|
|Publisher||International Foundation for Autonomous Agents and Multiagent Systems|
|Publication status||Published - 2014|
|Event||The undecidability of group announcements - Paris, France.|
Duration: 1 Jan 2014 → …
|Conference||The undecidability of group announcements|
|Period||1/01/14 → …|