Characterizing strongly admissible sets

Dunne, Paul E ORCID: 0000-0002-6033-3742
(2020) Characterizing strongly admissible sets. ARGUMENT & COMPUTATION, 11 (3). pp. 239-255.

[img] Text
revd_signature_strong.pdf - Author Accepted Manuscript

Download (262kB) | Preview


<jats:p>The concept of strong admissibility plays an important role in dialectical proof procedures for grounded semantics allowing, as it does, concise proofs that an argument belongs to the grounded extension without having necessarily to construct this extension in full. One consequence of this property is that strong admissibility (in contrast to grounded semantics) ceases to be a unique status semantics. In fact it is straightforward to construct examples for which the number of distinct strongly admissible sets is exponential in the number of arguments. We are interested in characterizing properties of collections of strongly admissible sets in the sense that any system describing the strongly admissible sets of an argument framework must satisfy particular criteria. In terms of previous studies, our concern is the signature and with conditions ensuring realizability. The principal result is to demonstrate that a system of sets describes the strongly admissible sets of some framework if and only if that system has the property of being decomposable.</jats:p>

Item Type: Article
Uncontrolled Keywords: Strong admissibility, signature, realizability, argumentation semantics
Depositing User: Symplectic Admin
Date Deposited: 06 Apr 2020 10:21
Last Modified: 18 Jan 2023 23:55
DOI: 10.3233/AAC-200483
Related URLs: