Strong admissibility revisited: theory and applications

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Dunne, Paul 2019. Strong admissibility revisited: theory and applications. Argument and Computation 10 (3) , pp. 277-300. 10.3233/AAC-190463

Preview

PDF - Accepted Post-Print Version Download (295kB) | Preview

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
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Taylor & Francis
ISSN:	1946-2166
Date of First Compliant Deposit:	31 July 2019
Date of Acceptance:	8 July 2019
Last Modified:	16 Nov 2024 01:15
URI:	https://orca.cardiff.ac.uk/id/eprint/124615

Citation Data

Cited 12 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item