Defense semantics of argumentation: revisit
Not on the map. Why?
Abstract (arXiv)
In this paper we introduce a novel semantics, called defense semantics, for Dung's abstract argumentation frameworks in terms of a notion of (partial) defence, which is a triple encoding that one argument is (partially) defended by another argument via attacking the attacker of the first argument. In terms of defense semantics, we show that defenses related to self-attacked arguments and arguments in 3-cycles are unsatifiable under any situation and therefore can be removed without affecting the defense semantics of an AF. Then, we introduce a new notion of defense equivalence of AFs, and compare defense equivalence with standard equivalence and strong equivalence, respectively. Finally, by exploiting defense semantics, we define two kinds of reasons for accepting arguments, i.e., direct reasons and root reasons, and a notion of root equivalence of AFs that can be used in argumentation summarization.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 12 references that are in the map. First posted on arXiv 20 Nov 2023.
Builds on
0 of 12 references.
No references here yet.
Built on by
Not cited yet.