| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4942148 | Artificial Intelligence | 2017 | 27 Pages |
Abstract
We investigate the relative expressivity of AAUL compared to other logics, most notably arbitrary public announcement logic (APAL). Additionally, we show that the model checking problem for AAUL is PSPACE-complete. Finally, we introduce a proof system for AAUL, and prove it to be sound and complete.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer,