Bibliographic Details
| Title: |
On the realisability of weak argumentation semantics. |
| Authors: |
Doukas, Theodoros1 (AUTHOR), Thimm, Matthias1 (AUTHOR) |
| Source: |
Journal of Logic & Computation. Dec2025, Vol. 35 Issue 8, p1-41. 41p. |
| Subjects: |
Mathematical bounds, Semantics, Systems theory |
| Abstract: |
We analyse representatives of the class of non-admissible semantics, particularly the undisputed, strongly undisputed, weakly admissible and weakly preferred semantics, in terms of realisability and their signatures. More specifically, we determine properties of the extension sets they produce, as well as structural features of frameworks that realize extension sets under these semantics. We describe two classes of extension sets for which we show that they are not realisable under undisputed semantics. We also identify approaches that have proven to be useful in the construction of frameworks that aim to realize given extension sets under classical semantics and transfer them to the non-admissible case. While a full characterisation of the signatures of the non-admissible semantics remains elusive, we provide plausible upper bounds and discuss the challenges in establishing concrete lower bounds. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
