author={Barteld P. Kooi and Bryan Renne},
  journal={The Review of Symbolic Logic},
  pages={536 - 559}
We present Arrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing “arrow updates” of Arrow Update Logic can be transformed into equivalent belief-changing “action models” from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logic… 

Arbitrary arrow update logic

Arrow Update Synthesis

Dynamic epistemic logic in update logic

It is shown that dynamic epistemic logic is a substructural logic and that it is an extension of the update logic, and a sequent calculus for update logic is provided which turns out to be a generalization of the non-associative Lambek calculus.

Arbitrary Arrow Update Logic with Common Knowledge is neither RE nor co-RE

By encoding the execution of a Turing machine in AAULC, it is shown that neither the valid formulas nor the satisfiable formulas of AAU LC are recursively enumerable.

Rethinking Epistemic Logic with Belief Bases

  • E. Lorini
  • Philosophy, Computer Science
    Artif. Intell.
  • 2020

The expressivity of update logics

Two new results about logics involving updates and common knowledge are proved that the logic LAU∗ using Arrow Common Knowledge is more expressive than the logic LAR using Relativized Common Knowledge and the logicLAUC using Arrow Updates and normal Common knowledge is equally expressive.

Logics of temporal-epistemic actions

Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation, is presented, providing complete axiomatizations for two theories of temporal action models and connecting the approach with previous work on time in DEL.

The undecidability of arbitrary arrow update logic

A History Based Logic for Dynamic Preference Updates

Motivated by game theoretical observations, how preferences can dynamically be updated in history based models is discussed, and arrow update logic and event calculus are considered, and historybased models for these logics are given.



Dynamic Epistemic Temporal Logic

We introduce a new type of arrow in the update frames (or "action models") of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in multi-agent systems that

Dynamic logic for belief revision

  • J. Benthem
  • Philosophy
    J. Appl. Non Class. Logics
  • 2007
This work shows how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added, and obtains complete logics for concrete mechanisms of belief revision based on compositional reduction axioms.

A qualitative theory of dynamic interactive belief revision

A logical setting is presented that incorporates a belief-revision mechanism within Dynamic-Epistemic logic, and it is shown how the update mechanism can “simulate”, in a uniform manner, many different belief- revision policies.

Logics of communication and change

A system for consistency preserving belief change

We present a dynamic doxastic logic which formalizes belief change for rational agents. It is based on the multi-agent modal logic KD45n, and therefore preserves the consistency of belief. The

Logics for Epistemic Programs

The construction of logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting by defining a notion of epistemic program, which is a Kripke model of ‘actions’, representing the agents' uncertainty about the current action in a similar way that Kripkel models are commonly used in epistemic logic.

Dynamic epistemic logic

A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.

Reasoning about Information Change

This paper introduces Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system, and gives a sound and complete axiomatization of the resulting logic.

Complexity and succinctness of public announcement logic

  • C. Lutz
  • Computer Science
    AAMAS '06
  • 2006
This paper considers the computational complexity of PAL and shows that it coincides with that of EL, and proves that there are properties that can be expressed exponentially more succinct in PAL than in EL.

The Surprise Examination in Dynamic Epistemic Logic

A number of different interpretations of the puzzle are discussed, and the failure of principle of success, that states that sentences, when learned, remain to be true and come to be believed, plays a central role in understanding the puzzle.