UWA Profiles and Research Repository (University of Western Australia) · 2008 · 60 citations · 6 references
Open access
HumanitiesComputer ScienceFormal MethodsKnowledge RepresentationLogicEpistemic LogicFormal EpistemologyAxiomatizationEpistemic Model TheoryEpistemic UpdatingMulti-agent Epistemic LogicPublic Announcement LogicSatisfiabilitySatisfiability Problem
Arbitrary public announcement logic (AP AL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (possibly arbitrary) epistemic for- mulae. It has been shown to be more expressive than epistemic logic, and a sound and complete axiomatization has been given. Here we address the question of decidability. We present a proof that the satisfiability problem for arbitrary public announcement logic (AP AL) is co-RE complete, via a tiling argument.
6
Mathematical Social Sciences · 1994 · 3.6K citations
The Undecidability of Iterated Modal Relativization
Joseph S. Miller, Lawrence S. Moss · Studia Logica · 2005 · 87 citations
What can we achieve by arbitrary announcements?
Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch et al. · 2007 · 51 citations · Full text