no code implementations • 21 Jan 2024 • Assaf Libman, Nir Oren, Bruno Yun
While different gradual semantics have been proposed in the literature, in this paper, we identify a large family of weighted gradual semantics, called abstract weighted based gradual semantics.
1 code implementation • 29 Nov 2022 • Nir Oren, Bruno Yun
The main contribution of our work is to demonstrate that the associated decision problem, i. e., whether a set of attacks can exist which allows the final acceptability degrees to occur for given initial weights, is NP-complete for the weighted h-categoriser and cardinality-based semantics, and is polynomial for the weighted max-based semantics, even for the complete version of the problem (where all initial weights and final acceptability degrees are known).
no code implementations • 8 Apr 2022 • Bruno Yun, Nir Oren, Madalina Croitoru
In this paper, we place ourselves in the context of human robot interaction and address the problem of cognitive robot modelling.
no code implementations • 2 Mar 2022 • Nir Oren, Bruno Yun, Assaf Libman, Murilo S. Baptista
Gradual semantics within abstract argumentation associate a numeric score with every argument in a system, which represents the level of acceptability of this argument, and from which a preference ordering over arguments can be derived.
no code implementations • 1 Feb 2022 • Nir Oren, Bruno Yun, Srdjan Vesic, Murilo Baptista
A sub-class of such semantics, the so-called weighted semantics, takes, in addition to the graph structure, an initial set of weights over the arguments as input, with these weights affecting the resultant argument ranking.
no code implementations • 19 Jun 2020 • Bruno Yun, Srdjan Vesic, Nir Oren
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria.
no code implementations • 6 Apr 2020 • Bruno Yun, Madalina Croitoru
We introduce a framework for reaching a consensus amongst several agents communicating via a trust network on conflicting information about their environment.
no code implementations • 1 Oct 2019 • César Prouté, Bruno Yun, Madalina Croitoru
In the presence of inconsistencies, repair techniques thrive to restore consistency by reasoning with several repairs.