mlsanityData to 14 Oct 2026

Changing agents and ascribing beliefs in dynamic epistemic logic

arXiv 2211.02452 ↗First posted 4 Nov 2022cs.AI cs.LO cs.MAcited by 0

Not on the map. Why?

Abstract (arXiv)

In dynamic epistemic logic (Van Ditmarsch, Van Der Hoek, & Kooi, 2008) it is customary to use an action frame (Baltag & Moss, 2004; Baltag, Moss, & Solecki, 1998) to describe different views of a single action. In this article, action frames are extended to add or remove agents, we call these agent-update frames. This can be done selectively so that only some specified agents get information of the update, which can be used to model several interesting examples such as private update and deception, studied earlier by Baltag and Moss (2004); Sakama (2015); Van Ditmarsch, Van Eijck, Sietsma, and Wang (2012). The product update of a Kripke model by an action frame is an abbreviated way of describing the transformed Kripke model which is the result of performing the action. This is substantially extended to a sum-product update of a Kripke model by an agent-update frame in the new setting. These ideas are applied to an AI problem of modelling a story. We show that dynamic epistemic logics, with update modalities now based on agent-update frames, continue to have sound and complete proof systems. Decision procedures for model checking and satisfiability have expected complexity. For a sublanguage, there are polynomial space algorithms.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 54 references that are in the map. First posted on arXiv 4 Nov 2022.

Builds on

6 of 54 references.

References · 6

  1. 2017A Gentle Introduction to Epistemic Planning: The DEL Approachcited by 9
  2. 2013On the Complexity of Dynamic Epistemic Logiccited by 4
  3. 2018Bundled fragments of first-order modal logic: (un)decidabilitycited by 4
  4. 2021Wanted Dead or Alive : Epistemic logic for impure simplicial complexescited by 3
  5. 2021A Simplicial Model for KB4n: Epistemic Logic with Agents that May Diecited by 2
  6. 2018On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Modelscited by 1

Built on by

Not cited yet.