Defense semantics of argumentation: revisit
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Neuro-Argumentative Learning with Case-Based Reasoning
On the Structure of Game Provenance and its Applications
A Formalisation of Abstract Argumentation in Higher-Order Logic
Deep Learning for Abstract Argumentation Semantics
MisGAN: Learning from Incomplete Data with Generative Adversarial Networks
An argumentative agent-based model of scientific inquiry
토론
이 논문과 연결된 포럼 글이 아직 없습니다.