Paper Info
Title
Characterizing Strongly Admissible Sets
Abstract
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.
Year
DOI
Venue
2020
10.3233/AAC-200483
ARGUMENT & COMPUTATION
Keywords
DocType
Volume
Strong admissibility, signature, realizability, argumentation semantics
Journal
11
Issue
ISSN
Citations 
3
1946-2166
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Paul E. Dunne11700112.42