(short version)

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.

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.

We study agents expressing propositional goals over a set of binary issues to reach a collective decision. We adapt properties and rules from the literature on Social Choice Theory to our setting, providing an axiomatic characterisation of a majority rule for goal-based voting. We study the computational complexity of finding the outcome of our rules (i.e., winner determination), showing that it ranges from Nondeterministic Polynomial Time (NP) to Probabilistic Polynomial Time (PP).

Ranking-based semantics are a way of assessing the acceptability of arguments in an abstract argumentation framework, by providing a ranking on arguments. This paper aims at going towards a generalization of the construction of such semantics, by investigating subsumption and incompatibility cases that may arise when principles that may enter into their composition are combined.

International audience

In the recent years, several formal approaches to the specification of normative multi-agent systems (MASs) and artificial institutions have been proposed. The aim of this article is to advance the state of the art in this area by proposing an approach in which a normative MAS is conceived to be autonomous, in the sense that it is able to create, maintain and eventually change its own institutions by itself, without the intervention of an external designer in this process. In our approach the existence and the dynamics of an institution (norms, rules, institutional facts, etc.) are determined by the (individual and collective) acceptances of its members, and its dynamics depends on the dynamics of these acceptances. In order to meet this objective, we propose the logic 𝒜ℒ (Acceptance Logic) in which the acceptance of a proposition by the agents qua members of an institution is introduced. Such propositions are true w.r.t. an institutional context and correspond to facts that are instituted in an attitude-dependent way. The second part of the article is devoted to the logical characterization of some important notions in the theory of institutions. We provide a formalization of the concept of constitutive rule, expressed by a statement of the form ‘X counts as Y in the context of institution x’. Then, we formalize the concepts of obligation and permission (so called regulative rules). In our approach, constitutive rules and regulative rules of a certain institution are attitude-dependent facts which are grounded on the acceptances of the members of the institution.