Arbitrary arrow update logic

H van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer*

*Bijbehorende auteur voor dit werk

OnderzoeksoutputAcademicpeer review

7 Citaten (Scopus)
2 Downloads (Pure)

Samenvatting

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. (C) 2016 Elsevier B.V. All rights reserved.

Originele taal-2English
Pagina's (van-tot)80-106
Aantal pagina's27
TijdschriftArtificial Intelligence
Volume242
Nummer van het tijdschrift1
DOI's
StatusPublished - jan-2017

Citeer dit