Concurrent Games in Dynamic Epistemic Logic

Abstract

<jats:p>Action models of Dynamic Epistemic Logic (DEL) represent precisely how actions are perceived by agents. DEL has recently been used to define infinite multi-player games, and it was shown that they can be solved in some cases. However, the dynamics being defined by the classic DEL update product for individual actions, only turn-based games have been considered so far. In this work we define a concurrent DEL product, propose a mechanism to resolve conflicts between actions, and define concurrent DEL games. As in the turn-based case, the obtained concurrent infinite game arenas can be finitely represented when all actions are public, or all are propositional. Thus we identify cases where the strategic epistemic logic ATL*K can be model checked on such games.</jats:p>

Coordinated Multi-Agent Exploration, Rendezvous, & Task Allocation in Unknown Environments with Limited Connectivity

“…Using robot and human actors, the framework in [18] recreates the Sally-Anne psychological test where a robot must reason about the human's beliefs. Typical multi-robot applications use DEL to solve for a cooperative set of actions in multiplayer games [19]. We extend DEL for a realistic multi-robot application allowing each robot to reason about the system's state considering system failures, task discovery, and partially known environments.…”

Knowing How to Plan

“…Moreover, while the de re variants of ATL are useful in reasoning about (imperfect information) concurrent games (cf. e.g., [18,17]), our framework is closer to the standard automated planning in AI over transition systems. We leave it to the full version of the paper for a detailed technical comparison.…”

Copy and remove as dynamic operators

“…Note that the parallel composition of events with effects is more delicate to define, as the postconditions of two concurrent events may be in conflict on the value to assign to certain propositions. This question has been investigated in e.g., [49,53,38].…”

“…If Π is a finite set of path expressions of length one, E rm (Π) is the parallel composition of all the E rm (π), for π ∈ Π, where the precondition of a conjunction of actions simply is the conjunction of the preconditions of its elements; this product represents the simultaneous occurrence of several action models. The idea of the definition of the parallel composition comes from [1], [15] and [38]. On the other hand, the composition of action models represents the sequential application of action models.…”