A Game-Theoretic Measure of Argument Strength for Abstract Argumentation

被引：80

作者：

Matt, Paul-Amaury ^{[1
]}

Toni, Francesca ^{[1
]}

机构：

[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2AZ, England

来源：

LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2008年 / 5293卷

关键词：

D O I：

10.1007/978-3-540-87803-2_24

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

argumentation (Dung 1995) is a theory of dialectic that allows us to formalise and study various notions of argument acceptability. We depart from this standard approach and formalise a measure of argument strength by applying the concept of value of a game, as defined in Game Theory (von Neumann 1928). The measure thus obtained satisfies a number of intuitively appealing properties that can be derived mathematically from the minimax theorem.

引用

页码：285 / 297

页数：13

共 30 条

[1]

Ambler S., 1996, Mathematical Structures in Computer Science, V6, P167, DOI 10.1017/S0960129500000931

[2]

Amgoud L., 1998, Uncertainty in Artificial Intelligence. Proceedings of the Fourteenth Conference (1998), P1

[3]

AMGOUD L, 2008, 2 INT C COMP MOD ARG, P13

[4]

[Anonymous], P 20 ANN C UNC ART I

[5] A logic-based theory of deductive arguments [J].

Besnard, P ;

Hunter, A .

ARTIFICIAL INTELLIGENCE, 2001, 128 (1-2) :203-235

[6] An abstract, argumentation-theoretic approach to default reasoning [J].

Bondarenko, A ;

Dung, PM ;

Kowalski, RA ;

Toni, F .

ARTIFICIAL INTELLIGENCE, 1997, 93 (1-2) :63-101

[7]

Borel E., 1921, COMPTES RENDUS ACAD

[8]

BUDZYNSKA K, 2008, 2 INT C COMP MOD ARG, P85

[9] Graduality in argumentation [J].

Cayrol, C ;

Lagasquie-Schiex, MC .

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2005, 23 :245-297

[10]

Dantzig G.B., 1955, Pacific J. Math., V5, P183

← 1 2 3 →