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 …

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 …

A dynamic framework, based on the Dynamic Logic of Propositional Assignments (DL-PA),
has recently been proposed for Dung's abstract argument system. This framework allows the …

Gossip problems are planning problems where several agents have to share information
('secrets') by means of phone calls between two agents. In epistemic gossip problems the …

Dynamic epistemic logics provide an account of the evolution of agents' belief and
knowledge when they learn the occurrence of an event. These logics started to become …

Most formalisms for multi-agent systems (MAS) are not adept at explicitly expressing of data
sharing between agents. Yet, disclosure and hiding of data amongst agents impacts on their …

We study a simple epistemic logic with a restricted language where formulas are boolean
combinations of (epistemic) atoms: sequences of'know-ing whether'operators followed by …

We introduce a subclass of concurrent game structures (CGS) with imperfect information in
which agents are endowed with private data-sharing capabilities. Importantly, our CGSs are …

In this thesis we study a lightweight framework in which to model knowledge and beliefs and
the evolution thereof in multiagent systems. The standard logic used for this is very …