@inproceedings{db2e6fb227974d3d88a646108f2f255a,
title = "Strong Admissibility Revisited",
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",
author = "Martin Caminada",
year = "2014",
doi = "10.3233/978-1-61499-436-7-197",
language = "English",
isbn = "9781614994350",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "197--208",
editor = "Simon Parsons and Nir Oren and Chris Reed and Frederico Cerutti",
booktitle = "Computational Models of Argument",
}