Arrow Research search

Author name cluster

Frédéric Maris

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.

7 papers
1 author row

Possible papers

7

JAAMAS Journal 2024 Journal Article

Logic-based cognitive planning for conversational agents

  • Jorge Luis Fernandez Davila
  • Dominique Longin
  • Frédéric Maris

Abstract This paper presents a novel approach to cognitive planning based on an NP-complete logic of explicit and implicit belief whose satisfiability checking problem is reduced to SAT. We illustrate the potential for application of our model by formalizing and then implementing a human–machine interaction scenario in which an artificial agent interacts with a human agent through dialogue and tries to motivate her to practice a sport. To make persuasion effective, the artificial agent needs a model of the human’s beliefs and desires which is built during interaction through a sequence of belief revision operations. We consider two cognitive planning algorithms and compare their performances, a brute force algorithm based on SAT and a QBF-based algorithm.

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.

AAAI Conference 2021 Conference Paper

A Simple Framework for Cognitive Planning

  • Jorge Luis Fernandez Davila
  • Dominique Longin
  • Emiliano Lorini
  • Frédéric Maris

We present a novel approach to cognitive planning, i. e. , an agent’s planning aimed at changing the cognitive attitudes of another agent including her beliefs and intentions. We encode the cognitive planning problem in an epistemic logic with a semantics exploiting belief bases. We study a NP-fragment of the logic whose satisfiability problem is reduced to SAT. We provide complexity results for the cognitive planning problem. Moreover, we illustrate its potential for applications in human-machine interaction in which an artificial agent is expected to interact with a human agent through dialogue and to persuade the human to behave in a certain way.

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.

IJCAI Conference 2020 Conference Paper

TouIST: a Friendly Language for Propositional Logic and More

  • Jorge Fernandez
  • Olivier Gasquet
  • Andreas Herzig
  • Dominique Longin
  • Emiliano Lorini
  • Frédéric Maris
  • Pierre Régnier

This work deals with logical formalization and problem solving using automated solvers. We present the automatic translator TouIST that provides a simple language to generate logical formulas from a problem description. Our tool allows us to model many static or dynamic combinatorial problems and to benefit from the regular improvements of SAT, QBF or SMT solvers in order to solve these problems efficiently. In particular, we show how to use TouIST to solve different classes of planning tasks in Artificial Intelligence.

IJCAI Conference 2019 Conference Paper

Dynamic logic of parallel propositional assignments and its applications to planning

  • Andreas Herzig
  • Frédéric Maris
  • Julien Vianey

We introduce a dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive. We show PSPACE completeness of both the model checking and the satisfiability problem and apply our logic to sequential and parallel classical planning where actions have conditional effects.