DeepAI AI Chat
Log In Sign Up

Attacker and Defender Counting Approach for Abstract Argumentation

by   Fuan Pu, et al.
Tsinghua University

In Dung's abstract argumentation, arguments are either acceptable or unacceptable, given a chosen notion of acceptability. This gives a coarse way to compare arguments. In this paper, we propose a counting approach for a more fine-gained assessment to arguments by counting the number of their respective attackers and defenders based on argument graph and argument game. An argument is more acceptable if the proponent puts forward more number of defenders for it and the opponent puts forward less number of attackers against it. We show that our counting model has two well-behaved properties: normalization and convergence. Then, we define a counting semantics based on this model, and investigate some general properties of the semantics.


page 1

page 2

page 3

page 4


Some Supplementaries to The Counting Semantics for Abstract Argumentation

Dung's abstract argumentation framework consists of a set of interacting...

Graduality in Argumentation

Argumentation is based on the exchange and valuation of interacting argu...

Defense semantics of argumentation: encoding reasons for accepting arguments

In this paper we show how the defense relation among abstract arguments ...

A Comparative Study of Ranking-based Semantics for Abstract Argumentation

Argumentation is a process of evaluating and comparing a set of argument...

Fuzzy Labeling Semantics for Quantitative Argumentation

The topic of evaluating argument strength in various quantitative argume...

Abstractly Interpreting Argumentation Frameworks for Sharpening Extensions

Cycles of attacking arguments pose non-trivial issues in Dung style argu...

Argument Ranking with Categoriser Function

Recently, ranking-based semantics is proposed to rank-order arguments fr...