Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Strong admissibility revisited: Theory and applications

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 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Argument & Computation IOS Press

Strong admissibility revisited: Theory and applications

Caminada, Martin; Dunne, Paul
Argument & Computation , Volume 10 (3): 24 – Jan 29, 2020
Download PDF
24 pages

Loading next page...
 
/lp/ios-press/strong-admissibility-revisited-theory-and-applications-1ofZuQpoX9

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2019 © 2019 – IOS Press and the authors.
ISSN
1946-2166
eISSN
1946-2174
DOI
10.3233/AAC-190463
Publisher site
See Article on Publisher Site

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, 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.

Journal

Argument & Computation – IOS Press

Published: Jan 29, 2020

References

  • An introduction to argumentation semantics
    Baroni
  • Self-stabilizing defeat status computation: Dealing with conflict management in multi-agent systems
    Baroni
  • On principle-based evaluation of extension-based argumentation semantics
    Baroni