Decidability in argumentation semantics

Dunne, Paul E ORCID: 0000-0002-6033-3742
(2023) Decidability in argumentation semantics. Argument & Computation. pp. 1-14.

[img] Text
aac-prepress_aac--1--1-aac220020_aac--1-aac220020.pdf - Author Accepted Manuscript

Download (185kB) | Preview


<jats:p>Much of the formal study of algorithmic concerns with respect to semantics for abstract argumentation frameworks has focused on the issue of computational complexity. In contrast matters regarding computability have been largely neglected. Recent trends in semantics have, however, started to concentrate not so much on the formulation of novel semantics but more on identifying common properties: for example, from basic ideas such as conflict-freeness through to quite sophisticated ideas such as serializability. The aim of this paper is to look at the implications these more recent studies have for computability rather than computational complexity.</jats:p>

Item Type: Article
Additional Information: Article in press; corrected proofs returned
Uncontrolled Keywords: computability, extension based semantics, semantic property
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 04 Aug 2023 10:33
Last Modified: 18 Sep 2023 08:26
DOI: 10.3233/aac-220020
Related URLs: