Analytical Solutions for the Inverse Problem within Gradual Semantics

by   Nir Oren, et al.

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. While some semantics operate over standard argumentation frameworks, many utilise a weighted framework, where a numeric initial weight is associated with each argument. Recent work has examined the inverse problem within gradual semantics. Rather than determining a preference ordering given an argumentation framework and a semantics, the inverse problem takes an argumentation framework, a gradual semantics, and a preference ordering as inputs, and identifies what weights are needed to over arguments in the framework to obtain the desired preference ordering. Existing work has attacked the inverse problem numerically, using a root finding algorithm (the bisection method) to identify appropriate initial weights. In this paper we demonstrate that for a class of gradual semantics, an analytical approach can be used to solve the inverse problem. Unlike the current state-of-the-art, such an analytic approach can rapidly find a solution, and is guaranteed to do so. In obtaining this result, we are able to prove several important properties which previous work had posed as conjectures.


page 1

page 2

page 3

page 4


The Inverse Problem for Argumentation Gradual Semantics

Gradual semantics with abstract argumentation provide each argument with...

Inferring Attack Relations for Gradual Semantics

A gradual semantics takes a weighted argumentation framework as input an...

Some Supplementaries to The Counting Semantics for Abstract Argumentation

Dung's abstract argumentation framework consists of a set of interacting...

Deep Learning for Abstract Argumentation Semantics

In this paper, we present a learning-based approach to determining accep...

Finding Convincing Arguments Using Scalable Bayesian Preference Learning

We introduce a scalable Bayesian preference learning method for identify...

Technical Report on Implementing Ranking-Based Semantics in ConArg

ConArg is a suite of tools that offers a wide series of applications for...

Implementing Ranking-Based Semantics in ConArg: a Preliminary Report

ConArg is a suite of tools that offers a wide series of applications for...

Please sign up or login with your details

Forgot password? Click here to reset