Strong admissibility revisited

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2014. Strong admissibility revisited. Parsons, Simon, Oren, Nir, Reed, Chris and Cerutti, Federico, eds. Computational Models of Argument, Vol. 266. Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 197-208. (10.3233/978-1-61499-436-7-197)

Full text not available from this repository.

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. 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 Persuasion Game.

Item Type:	Book Section
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	IOS Press
ISBN:	9781614994350
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84284

Citation Data

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

Actions (repository staff only)

Edit Item