A proposition is noncontingent, if it is necessarily true or it is necessarily false. In an
epistemic context,'a proposition is noncontingent'means that you know whether the …

In recent years, multi-agent epistemic planning has received attention from both dynamic
logic and planning communities. Existing implementations of multi-agent epistemic planning …

A gossip protocol is a procedure for spreading secrets among a group of agents, using a
connection graph. In each call between a pair of connected agents, the two agents share all …

Abstract The seminar Epistemic Planning brought together the research communities of
Dynamic Epistemic Logic, Knowledge Representation and Reasoning, and Automated …

We study multiagent epistemic planning with a simple epistemic logic whose language is a
restriction of that of standard epistemic logic. Its formulas are boolean combinations of …

Although multi-robot systems have received substantial re-search attention in recent years,
multi-robot coordination still remains a difficult task. Especially, when dealing with spatially …

A group of 100 prisoners, all together in the prison dining area, are told that they will be all
put in isolation cells and then will be interrogated one by one in a room containing a light …

Gossip protocols aim at arriving, by means of point-to-point or group communications, at a
situation in which all the agents know each other's secrets. We consider distributed gossip …

The so-called gossip problem is a formal model of peer-to-peer communication. In order to
perform such communication efficiently, it is important to keep track of what agents know …

We provide a logical investigation of a simple case of communication in a network of agents
called the gossip problem. Its classical version is: given n agents each of which has a secret …