On Computing Stable Extensions of Abstract Argumentation Frameworks

11/03/2020
by   Samer Nofal, et al.
0

An abstract argumentation framework (af for short) is a directed graph (A,R) where A is a set of abstract arguments and R⊆ A × A is the attack relation. Let H=(A,R) be an af, S ⊆ A be a set of arguments and S^+ = {y |∃ x∈ S with (x,y)∈ R}. Then, S is a stable extension in H if and only if S^+ = A∖ S. In this paper, we present a thorough, formal validation of a known backtracking algorithm for listing all stable extensions in a given af.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

12/20/2013

The DIAMOND System for Argumentation: Preliminary Report

Abstract dialectical frameworks (ADFs) are a powerful generalisation of ...
07/09/2002

Collective Argumentation

An extension of an abstract argumentation framework, called collective a...
02/25/2014

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

We study the computational complexity of problems that arise in abstract...
04/27/2015

Theory of Semi-Instantiation in Abstract Argumentation

We study instantiated abstract argumentation frames of the form (S,R,I),...
06/16/2020

The SCC-recursiveness Principle in Fuzzy Argumentation Frameworks

Dung's abstract argumentation theory plays a guiding role in the field o...
09/16/2020

An Imprecise Probability Approach for Abstract Argumentation based on Credal Sets

Some abstract argumentation approaches consider that arguments have a de...
04/21/2022

Revisiting initial sets in abstract argumentation

We revisit the notion of initial sets by Xu and Cayrol, i.e., non-empty ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.