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 |
| Summary: | 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. |
|---|---|
| ISSN: | 1946-2166 1946-2174 |