Strong admissibility revisited: Theory and applications
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 r...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOS Press
2020-01-01
|
| Series: | Argument & Computation |
| Online Access: | https://doi.org/10.3233/AAC-190463 |
| _version_ | 1797860880375873536 |
|---|---|
| author | Martin Caminada Paul Dunne |
| author_facet | Martin Caminada Paul Dunne |
| author_sort | Martin Caminada |
| collection | DOAJ |
| description |
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. |
| first_indexed | 2024-04-09T21:54:12Z |
| format | Article |
| id | doaj.art-64172669a5eb4552843f818038f880fd |
| institution | Directory Open Access Journal |
| issn | 1946-2166 1946-2174 |
| language | English |
| last_indexed | 2024-04-09T21:54:12Z |
| publishDate | 2020-01-01 |
| publisher | IOS Press |
| record_format | Article |
| series | Argument & Computation |
| spelling | doaj.art-64172669a5eb4552843f818038f880fd2023-03-24T09:48:02ZengIOS PressArgument & Computation1946-21661946-21742020-01-0110327730010.3233/AAC-190463Strong admissibility revisited: Theory and applicationsMartin Caminada0Paul Dunne1Cardiff University, Queen’s Buildings, 5 The Parade, Cardiff CF24 2LQ, United Kingdom. E-mail: CaminadaM@cardiff.ac.ukUniversity of Liverpool, Ashton Building, Liverpool L69 7ZF, United Kingdom. E-mail: P.E.Dunne@liverpool.ac.uk 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.https://doi.org/10.3233/AAC-190463 |
| spellingShingle | Martin Caminada Paul Dunne Strong admissibility revisited: Theory and applications Argument & Computation |
| title | Strong admissibility revisited: Theory and applications |
| title_full | Strong admissibility revisited: Theory and applications |
| title_fullStr | Strong admissibility revisited: Theory and applications |
| title_full_unstemmed | Strong admissibility revisited: Theory and applications |
| title_short | Strong admissibility revisited: Theory and applications |
| title_sort | strong admissibility revisited theory and applications |
| url | https://doi.org/10.3233/AAC-190463 |
| work_keys_str_mv | AT martincaminada strongadmissibilityrevisitedtheoryandapplications AT pauldunne strongadmissibilityrevisitedtheoryandapplications |