T Bolander - arXiv preprint arXiv:1703.02192, 2017 - arxiv.org
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a …
X Liu, E Lorini - Logic and Argumentation: 4th International Conference …, 2021 - Springer
Recent years have witnessed a renewed interest in Boolean functions in explaining binary classifiers in the field of explainable AI (XAI). The standard approach to Boolean functions is …
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 …
X Liu, E Lorini - Journal of Logic and Computation, 2023 - academic.oup.com
Recent years have witnessed a renewed interest in the explanation of classifier systems in the field of explainable AI (XAI). The standard approach is based on propositional logic. We …
A realistic model of multi-agent planning must allow us to formalize notions which are absent in classical planning, such as communication and knowledge. We investigate multi-agent …
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 …
T Charrier, A Herzig, E Lorini, F Maffre… - … Conference on the …, 2016 - cdn.aaai.org
We study an epistemic logic where knowledge is built from what the agents observe (including higher-order visibility) and what the agents learn from public announcements …
T Bolander - Jaakko Hintikka on knowledge and game-theoretical …, 2018 - Springer
In this paper we show how to formalise false-belief tasks like the Sally-Anne task and the second-order chocolate task in Dynamic Epistemic Logic (DEL). False-belief tasks are used …
A Herzig, F Maffre - AI Communications, 2017 - content.iospress.com
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 …