Strong Admissibility Revisited

Martin Caminada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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
Original languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2014
EditorsSimon Parsons, Nir Oren, Chris Reed, Frederico Cerutti
Place of PublicationAmsterdam
PublisherIOS Press
Pages197-208
Number of pages12
ISBN (Electronic)9781614994367
ISBN (Print)9781614994350
DOIs
Publication statusPublished - 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press
Volume266

Fingerprint Dive into the research topics of 'Strong Admissibility Revisited'. Together they form a unique fingerprint.

  • Cite this

    Caminada, M. (2014). Strong Admissibility Revisited. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.), Computational Models of Argument: Proceedings of COMMA 2014 (pp. 197-208). (Frontiers in Artificial Intelligence and Applications; Vol. 266). IOS Press. https://doi.org/10.3233/978-1-61499-436-7-197