On Computing Stable Extensions of Abstract Argumentation Frameworks
share
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