English

Revisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version)

Artificial Intelligence 2024-08-27 v1

Abstract

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.

Keywords

Cite

@article{arxiv.2408.14069,
  title  = {Revisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version)},
  author = {Lydia Blümel and Matthias Thimm},
  journal= {arXiv preprint arXiv:2408.14069},
  year   = {2024}
}

Comments

The paper has been accepted at ECAI 2024, this is an extended version including proofs of technical results

R2 v1 2026-06-28T18:23:39.667Z