Search Results for author: Bruno Yun

Found 8 papers, 1 papers with code

Abstract Weighted Based Gradual Semantics in Argumentation Theory

no code implementations21 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.

valid

Inferring Attack Relations for Gradual Semantics

1 code implementation29 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).

Utility Functions for Human/Robot Interaction

no code implementations8 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.

Analytical Solutions for the Inverse Problem within Gradual Semantics

no code implementations2 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.

Abstract Argumentation

The Inverse Problem for Argumentation Gradual Semantics

no code implementations1 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.

Abstract Argumentation

Representing Pure Nash Equilibria in Argumentation

no code implementations19 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.

Trust-based Multiagent Consensus or Weightings Aggregation

no code implementations6 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.

Distance-Based Approaches to Repair Semantics in Ontology-based Data Access

no code implementations1 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.