Revisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version)
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929474366341120 |
|---|---|
| author | Blümel, Lydia Thimm, Matthias |
| author_facet | Blümel, Lydia Thimm, Matthias |
| contents | We consider the notion of a vacuous reduct semantics for abstract argumentation frameworks, which, given two abstract argumentation semantics σ and τ, refines σ (base condition) by accepting only those σ-extensions that have no non-empty τ-extension in their reduct (vacuity condition). We give a systematic overview on vacuous reduct semantics resulting from combining different admissibility-based and conflict-free semantics and present a principle-based analysis of vacuous reduct semantics in general. We provide criteria for the inheritance of principle satisfaction by a vacuous reduct semantics from its base and vacuity condition for established as well as recently introduced principles in the context of weak argumentation semantics. We also conduct a principle-based analysis for the special case of undisputed semantics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14069 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Revisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version) Blümel, Lydia Thimm, Matthias Artificial Intelligence We consider the notion of a vacuous reduct semantics for abstract argumentation frameworks, which, given two abstract argumentation semantics σ and τ, refines σ (base condition) by accepting only those σ-extensions that have no non-empty τ-extension in their reduct (vacuity condition). We give a systematic overview on vacuous reduct semantics resulting from combining different admissibility-based and conflict-free semantics and present a principle-based analysis of vacuous reduct semantics in general. We provide criteria for the inheritance of principle satisfaction by a vacuous reduct semantics from its base and vacuity condition for established as well as recently introduced principles in the context of weak argumentation semantics. We also conduct a principle-based analysis for the special case of undisputed semantics. |
| title | Revisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version) |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2408.14069 |