Arbitrary Arrow Update Logic



van Ditmarsch, H, Van Der Hoek, W, Kooi, B and Kuijer, L ORCID: 0000-0001-6696-9023
(2017) Arbitrary Arrow Update Logic. Artificial Intelligence, 242. pp. 80-106.

This is the latest version of this item.

[img] Text
revision_v3.pdf - Author Accepted Manuscript

Download (609kB)

Abstract

In this paper we introduce arbitrary arrow update logic (AAUL). The logic AAUL takes arrow update logic, a dynamic epistemic logic where the accessibility relations of agents are updated rather than the set of possible worlds, and adds a quantifier over such arrow updates. 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.

Item Type: Article
Uncontrolled Keywords: modal logic, knowledge representation, arrow update logic, dynamic epistemic logic, arbitrary arrow update logic, arbitrary announcement logic
Depositing User: Symplectic Admin
Date Deposited: 02 Mar 2017 09:00
Last Modified: 19 Jan 2023 07:19
DOI: 10.1016/j.artint.2016.10.003
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3005445

Available Versions of this Item