Computing Grounded Extensions Of Abstract Argumentation Frameworks

Nofal, Samer, Atkinson, Katie ORCID: 0000-0002-5683-4106 and Dunne, Paul E ORCID: 0000-0002-6033-3742
(2021) Computing Grounded Extensions Of Abstract Argumentation Frameworks. COMPUTER JOURNAL, 64 (1). pp. 54-63.

[img] Text
groundedAlgorithms.pdf - Author Accepted Manuscript

Download (475kB) | Preview


<jats:title>Abstract</jats:title> <jats:p>An abstract argumentation framework is a directed graph $(V,E)$ such that the vertices of $V$ denote abstract arguments and $E \subseteq V \times V$ represents the attack relation between them. We present a new ad hoc algorithm for computing the grounded extension of an abstract argumentation framework. We show that the new algorithm runs in $\mathcal{O}(|V|+|E|)$ time. In contrast, the existing state-of-the-art algorithm runs in $\mathcal{O}(|V|+|S||E|)$ time where $S$ is the grounded extension of the input graph.</jats:p>

Item Type: Article
Uncontrolled Keywords: directed graph, algorithm, grounded extension, argumentation graph, argumentation semantics, abstract argumentation framework
Depositing User: Symplectic Admin
Date Deposited: 19 Nov 2019 10:53
Last Modified: 19 Jan 2023 00:19
DOI: 10.1093/comjnl/bxz138
Related URLs: