Author name cluster

Elise Perrotin

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

11 papers

2 author rows

AAAI Conference 2025 Conference Paper

A Computationally Grounded Framework for Cognitive Attitudes

Tiago de Lima
Emiliano Lorini
Elise Perrotin
François Schwarzentruber

We introduce a novel language for reasoning about agents' cognitive attitudes of both epistemic and motivational type. We interpret it by means of a computationally grounded semantics using belief bases. Our language includes five types of modal operators for implicit belief, complete attraction, complete repulsion, realistic attraction and realistic repulsion. We give an axiomatization and show that our operators are not mutually expressible and that they can be combined to represent a large variety of psychological concepts including ambivalence, indifference, being motivated, being demotivated and preference. We present a dynamic extension of the language that supports reasoning about the effects of belief change operations. Finally, we provide a succinct formulation of model checking for our languages and a PSPACE model checking algorithm relying on a reduction into TQBF. We present some experimental results for the implemented algorithm on computation time in a concrete example.

PDF Details DOI

AAAI Conference 2025 Conference Paper

A Logical Analysis of Hanabi

Elise Perrotin

The card game Hanabi has recently gained popularity as a benchmark for handling epistemic reasoning in AI systems. However it has until now mostly been approached through the lens of machine learning rather than formal logical analysis. This is mostly due to the fact that modeling Hanabi in the standard epistemic logic DEL is untractable. In this paper we take a different approach to formalizing Hanabi, using the simple epistemic logic EL-O as a starting point. We generalize common knowledge in EL-O to arbitrary groups of agents and show how to overcome some of the limitations EL-O places on agent reasoning by introducing a special reasoning action. Analyzing our formalization of Hanabi finally leads us to introduce an alternative semantics for our generalization of EL-O in which models are finite and satisfiability checking is NP-complete, and which is enough to fully describe the evolution of knowledge in a game of Hanabi.

PDF Details DOI

AAAI Conference 2024 Conference Paper

Towards Epistemic-Doxastic Planning with Observation and Revision

Thorsten Engesser
Andreas Herzig
Elise Perrotin

Epistemic planning is useful in situations where multiple agents have different knowledge and beliefs about the world, such as in robot-human interaction. One aspect that has been largely neglected in the literature is planning with observations in the presence of false beliefs. This is a particularly challenging problem because it requires belief revision. We introduce a simple specification language for reasoning about actions with knowledge and belief. We demonstrate our approach on well-known false-belief tasks such as the Sally-Anne Task and compare it to other action languages. Our logic leads to an epistemic planning formalism that is expressive enough to model second-order false-belief tasks, yet has the same computational complexity as classical planning.

PDF Details DOI

JELIA Conference 2023 Conference Paper

Belief Reconfiguration

Sébastien Konieczny
Elise Perrotin
Ramón Pino Pérez

Abstract We study a generalisation of iterated belief revision in a setting where we keep track not only of the received information (in the form of messages) but also of the source of each message. We suppose that we have a special source, the oracle, which never fails. That is, all of the information provided by the oracle is assumed to be correct. We then evaluate the reliability of each source by confronting its messages with the facts given by the oracle. In this case it is natural to give higher priority to messages coming from more reliable sources. We therefore re-order (reconfigurate) the messages with respect to the reliability of the sources before performing iterated belief revision. We study how to compute this reliability, and the properties of the corresponding reconfiguration operators.

Details

IJCAI Conference 2022 Conference Paper

A Computationally Grounded Logic of 'Seeing-to-it-that'

Andreas Herzig
Emiliano Lorini
Elise Perrotin

We introduce a simple model of agency that is based on the concepts of control and attempt. Both relate agents and propositional variables. Moreover, they can be nested: an agent i may control whether another agent j controls a propositional variable p; i may control whether j attempts to change p; i may attempt to change whether j controls p; i may attempt to change whether j attempts to change p; and so on. In this framework we define several modal operators of time and agency: the LTL operators on the one hand, and the Chellas and the deliberative stit operator on the other. While in the standard stit framework the model checking problem is unfeasible because its models are infinite, in our framework models are represented in a finite and compact way: they are grounded on the primitive concepts of control and attempt. This makes model checking practically feasible. We prove its PSPACE-completeness and we show how the concept of social influence can be captured.

PDF Details DOI

KR Conference 2022 Conference Paper

Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models

Emiliano Lorini
Elise Perrotin
François Schwarzentruber

We compare the syntactic multi-agent belief base approach, and the dynamic epistemic logic possible world semantic approach. In the belief base approach, the language provides an implicit and an explicit belief operators, plus a dynamic modality for actions consisting in adding formulae to bases. For the semantic approach, we rely on action models of Dynamic Epistemic Logic (DEL). We first show how to translate a formula of the belief base approach into DEL: in particular, we provide a specific action model scheme corresponding to the addition of a formula in a belief base. Conversely, we identify a fragment of DEL that can be translated in the multi- agent belief base language.

PDF Details DOI

KR Conference 2021 Short Paper

A Dynamic Epistemic Logic with Finite Iteration and Parallel Composition

Andreas Herzig
Frédéric Maris
Elise Perrotin

Existing dynamic epistemic logics combine standard epistemic logic with a restricted version of dynamic logic. Instead, we here combine a restricted epistemic logic with a rich version of dynamic logic. The epistemic logic is based on `knowing-whether' operators and basically disallows disjunctions and conjunctions in their scope; it moreover captures `knowing-what'. The dynamic logic has not only all the standard program operators of Propositional Dynamic Logic, but also parallel composition as well as an operator of inclusive nondeterministic composition; its atomic programs are assignments of propositional variables. We show that the resulting dynamic epistemic logic is powerful enough to capture several kinds of sequential and parallel planning, and so both in the unbounded and in the finite horizon version.

PDF Details DOI

AIJ Journal 2021 Journal Article

A lightweight epistemic logic and its application to planning

Martin C. Cooper
Andreas Herzig
Faustine Maffre
Frédéric Maris
Elise Perrotin
Pierre Régnier

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 observability atoms: sequences of ‘knowing whether’ operators followed by propositional variables. This compares favourably with other restricted languages where formulas are boolean combinations of epistemic literals: sequences of ‘knowing that’ epistemic operators and negations followed by propositional variables; or in other terms: epistemic formulas without conjunctions or disjunctions. The reason is that our language enables a richer theory of mind: we can express statements such as “I don't know whether p, but I know that you know whether p” which are important in communication and more generally in interaction and which cannot be expressed with epistemic literals. Going beyond previous work, we also introduce a ‘common knowledge whether’ operator. We show that satisfiability is nevertheless NP-complete. We then define simple epistemic planning tasks as generalisations of classical planning tasks: action descriptions have sets of observability atoms as add- and delete-lists, initial states are sets of observability atoms, and goals are boolean combinations of observability atoms. We show that simple epistemic planning tasks can be polynomially translated into classical planning tasks. It follows that checking solvability of simple epistemic planning tasks is PSpace-complete. We present some application examples such as the gossip problem and some experimental results and clarify the relationship with Dynamic Epistemic Logic-based planning.

Details DOI

ECAI Conference 2020 Conference Paper

A Logic of Explicit and Implicit Distributed Belief

Andreas Herzig
Emiliano Lorini
Elise Perrotin
Fabián Romero
François Schwarzentruber

We present a new logic of explicit and implicit distributed belief with a formal semantics exploiting the notion of belief base. A coalition’s distributed belief of explicit type corresponds to a piece of information contained in the collective belief base of the coalition, which is obtained by pooling together the individual belief bases of its members. A coalition’s distributed belief of implicit type corresponds to a piece of information that is derivable from the collective belief base of the coalition. We study axiomatic aspects of our logic as well as complexity of model checking. As distributed belief can be inconsistent (contrary to distributed knowledge), we also study a consistency-preserving variant of distributed belief inspired by the literature on belief merging.

Details

KR Conference 2020 Conference Paper

Lightweight Parallel Multi-Agent Epistemic Planning

Martin Cooper
Andreas Herzig
Frédéric Maris
Elise Perrotin
Julien Vianey

We study a simple version of multi-agent epistemic planning where the number of parallel steps has to be minimized. We prove that this extension of classical planning is in PSPACE. We propose an encoding in PDDL and present some experiments providing evidence that this encoding allows us to solve practical problems. The types of problems we can encode include problems in which one agent can teach another agent how to perform a task and communication problems where some information must not be revealed to some agents.

PDF Details DOI

LORI Conference 2019 Conference Paper

Public Group Announcements and Trust in Doxastic Logic

Elise Perrotin
Rustam Galimullin
Quentin Canu
Natasha Alechina

Abstract We present a doxastic logic for multi-agent systems with public group announcements. Beliefs are represented using belief bases and a dynamic of trust is introduced in order to handle belief change under contradictory announcements. We provide a complete axiomatization for this logic and illustrate its expressive power with a simple example.

Details