Revisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version)
Blümel, Lydia, Thimm, Matthias
–arXiv.org Artificial Intelligence
We consider the notion of a vacuous reduct semantics for abstract argumentation frameworks, which, given two abstract argumentation semantics {\sigma} and {\tau}, refines {\sigma} (base condition) by accepting only those {\sigma}-extensions that have no non-empty {\tau}-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.
arXiv.org Artificial Intelligence
Aug-26-2024
- Country:
- Asia > Middle East
- Israel > Haifa District > Haifa (0.04)
- Europe
- North America > United States
- Arizona > Maricopa County
- Phoenix (0.04)
- District of Columbia > Washington (0.04)
- Arizona > Maricopa County
- Asia > Middle East
- Genre:
- Research Report (0.64)
- Technology: