Arrow Research search
Back to ECAI

ECAI 2024

Revisiting Vacuous Reduct Semantics for Abstract Argumentation

Conference Paper Accepted Paper Artificial Intelligence

Abstract

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.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
European Conference on Artificial Intelligence
Archive span
1982-2025
Indexed papers
5223
Paper id
71491909908418930
v2026.09.13