Undecidability for arbitrary public announcement logic
Year: 2008
Type: book-chapter
Abstract: 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.
Authors: Tim French, Hans P. van Ditmarsch
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W87282152
