Strong admissibility revisited: Theory and applications

Caminada, Martin and Dunne, Paul ORCID: 0000-0002-6033-3742 (2019) Strong admissibility revisited: Theory and applications. ARGUMENT & COMPUTATION, 10 (3). pp. 277-300.

Text
strong_adm_AAC.pdf - Author Accepted Manuscript
Download (218kB) | Preview

Official URL: http://dx.doi.org/10.3233/aac-190463

Abstract

In the current paper, we re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its extension-based and in its labelling-based form, and analyse the computational complexity of the relevant decision problems. Moreover, we show that strong admissibility plays a vital role in discussion-based proof procedures for grounded semantics. In particular it allows one to compare the performance of alternative dialectical proof procedures for grounded semantics, and obtain some remarkable differences between the Standard Grounded Game and the Grounded Discussion Game.

Item Type:	Article
Uncontrolled Keywords:	Strong admissibility, grounded semantics, argument games
Depositing User:	Symplectic Admin
Date Deposited:	09 Jul 2019 12:59
Last Modified:	21 Aug 2023 13:18
DOI:	10.3233/AAC-190463
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3049227