We propose a number of powerful dynamic-epistemic logics for multi-agent information
sharing and acts of publicly or privately accessing other agents' information databases. The …

The existence of a coalition strategy to achieve a goal does not necessarily mean that the
coalition has enough information to know how to follow the strategy. Neither does it mean …

Simplicial complexes are a versatile and convenient paradigm on which to build all the tools
and techniques of the logic of knowledge, on the assumption that initial epistemic models …

We propose communication pattern logic. A communication pattern describes how
processes or agents inform each other, independently of the information content. The full …

Any kind of dynamics in dynamic epistemic logic can be represented as an action model.
Right? Wrong! In this contribution we prove that the update expressivity of communication …

Combinatorial topology is used in distributed computing to model concurrency and
asynchrony. The basic structure in combinatorial topology is the simplicial complex, a …

There are several ways to quantify over public announcements. The most notable are
reflected in arbitrary, group, and coalition announcement logics (APAL, GAL, and CAL …

This is an entry for the Stanford Encyclopedia of Philosophy surveying the broad area of
logics for analyzing games. The main topics are Game Structure, Nature of Players, and …

Coalition announcement logic is one of the family of logics of quantified announcements. It
extends public announcement logic with formulas $\langle\![G]\!\rangle\varphi $ that are read …

In this paper, we propose a dynamic epistemic framework to capture the knowledge
evolution in multi-agent systems where agents are not able to observe. We formalize multi …