A Game-Theoretic Measure of Argument Strength for Abstract Argumentation

Authors:
Paul-Amaury Matt;Francesca Toni
Affiliations:
Department of Computing, Imperial College London,;Department of Computing, Imperial College London,
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 19
Cited 12

How to reason defeasibly

Artificial Intelligence
Probabilistic Horn abduction and Bayesian networks

Artificial Intelligence
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning

Artificial Intelligence
A logic-based theory of deductive arguments

Artificial Intelligence
Defeasible reasoning with variable degrees of justification

Artificial Intelligence
Credulous and Sceptical Argument Games for Preferred Semantics

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Normative Argumentation and Qualitative Probability

ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
Two party immediate response disputes: properties and efficiency

Artificial Intelligence
Using arguments for making decisions: a possibilistic logic approach

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Coherence and Flexibility in Dialogue Games for Argumentation

Journal of Logic and Computation
Computing ideal sceptical argumentation

Artificial Intelligence
Mechanism design for abstract argumentation

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Measures for persuasion dialogs: A preliminary investigation

Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Modeling Persuasiveness: change of uncertainty through agents' interactions

Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Heuristics in Argumentation: A Game-Theoretical Investigation

Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Graduality in argumentation

Journal of Artificial Intelligence Research
Dialectic proof procedures for assumption-based, admissible argumentation

Artificial Intelligence
On the acceptability of arguments in preference-based argumentation

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence

Lower Bounds on Argument Verification in Computational Dialectic

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Change in abstract argumentation frameworks: adding an argument

Journal of Artificial Intelligence Research
Weighted argument systems: Basic definitions, algorithms, and complexity results

Artificial Intelligence
A heuristics-based pruning technique for argumentation trees

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Dominant decisions by argumentation agents

ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Building consensus via a semantic web collaborative space

Proceedings of the 21st international conference companion on World Wide Web
Changing one's mind: erase or rewind? possibilistic belief revision with fuzzy argumentation based on trust

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Social abstract argumentation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Argumentation and voting for an intelligent user empowering business directory on the web

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Audience-based uncertainty in abstract argument games

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Using argument strength for building dialectical bonsai

Annals of Mathematics and Artificial Intelligence
Coalitions of Arguments: An Approach with Constraint Programming

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract 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.