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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambler, S.J.: A Categorical Approach to the Semantics of Argumentation. Mathematical Structures in Computer Science 6(2), 167–188 (1996)
Amgoud, L., Cayrol, C.: On the acceptability of arguments in preference-based argumentation. In: 14th Conference on Uncertainty in Artificial Intelligence (UAI 1998), pp. 1–7 (1998)
Amgoud, L., Prade, H.: Using Arguments for Making Decisions: A Possibilistic Logic Approach. In: 20th Conference of Uncertainty in Artificial Intelligence (UAI 2004), pp. 10–17 (2004)
Amgoud, L., Dupin de Saint-Cyr, F.: Measures for Persuasion Dialogs: A Preliminary Investigation. In: 2nd International Conference on Computational Models of Argument (COMMA 2008), pp. 13–24 (2008)
Besnard, P., Hunter, A.: A logic-based theory of deductive arguments. Artificial Intelligence 128, 203–235 (2001)
Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence 93(1-2), 63–101 (1997)
Borel, E.: La théorie du jeu et les équations intégrales à noyau symétrique gauche. Comptes Rendus de l’Académie des Sciences (1921)
Budzyńska, K., Kacprzak, M., Rembelski, P.: Modelling Persuasiveness: Change of Uncertainty Through Agents’ Interactions. In: 2nd International Conference on Computational Models of Argument (COMMA 2008), pp. 85–96 (2008)
Cayrol, C., Lagasquie-Schiex, M.-C.: Graduality in Argumentation. Journal of Artificial Intelligence Research 23, 245–297 (2005)
Dantzig, G.B., Orden, A., Wolfe, P.: The generalised simplex method for minimizing a linear form under linear inequality constraints. Pacific Journal of Mathematics 5(2), 183–195 (1955)
Dresher, M.: The Mathematics of Games of Strategy. Dover Publications (1981)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77(2), 321–357 (1995)
Dung, P.M., Kowalski, R., Toni, F.: Dialectic proof procedures for assumption-based, admissible argumentation. Artificial Intelligence 170(2), 114–159 (2006)
Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artificial Intelligence 171, 642–674 (2007)
Dunne, P.E., Bench-Capon, T.J.M.: Two party immediate response disputes: Properties and efficiency. Artificial Intelligence 149, 221–250 (2003)
Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 6th edn. McGraw-Hill, New York (1995)
Jakobovits, H., Vermeir, D.: Robust semantics for argumentation frameworks. Journal of logic and computation 9(2), 215–261 (1999)
Kohlas, J., Haenni, R., Berzati, D.: Probabilistic argumentation systems and abduction. In: 8th International Workshops on Non-Monotonic Reasoning, pp. 391–398 (2000)
Krause, P., Ambler, S., Elvang-Gøransson, M., Fox, J.: A logic of argumentation for reasoning under uncertainty. Computational Intelligence 11, 113–131 (1995)
Parsons, S.: Normative argumentation and qualitative probability. In: 1st International Joint Conference on Qualitative and Quantitative Practical Reasoning, pp. 466–480 (1997)
Pollock, J.L.: How to reason defeasibly. Artificial Intelligence 57, 1–42 (1992)
Pollock, J.L.: Defeasible reasoning with variable degrees of justification. Artificial Intelligence 133, 233–282 (2001)
Poole, D.: Probabilistic Horn Abduction and Bayesian Networks. Artificial Intelligence 64, 81–129 (1993)
Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. Journal of Applied Non Classical Logics 7, 25–75 (1997)
Prakken, H.: Coherence and Flexibility in Dialogue Games for Argumentation. Journal of Logic and Computation 15(6), 1009–1040 (2005)
Rahwan, I., Larson, K.: Mechanism Design for Abstract Argumentation. In: 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1031–1038 (2008)
Riveret, R., Prakken, H., Rotolo, A., Sartor, G.: Heuristics in Argumentation: A Game-Theoretical Investigation. In: 2nd International Conference on Computational Models of Argument (COMMA 2008), pp. 324–335 (2008)
Vreeswijk, G., Prakken, H.: Credulous and sceptical argument games for preferred semantics. In: Brewka, G., Moniz Pereira, L., Ojeda-Aciego, M., de Guzmán, I.P. (eds.) JELIA 2000. LNCS (LNAI), vol. 1919, pp. 239–253. Springer, Heidelberg (2000)
von Neumann, J.: Zur Theorie des Gesellschaftsspiele. Mathematische Annalen 100, 295–320 (1928)
von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matt, PA., Toni, F. (2008). A Game-Theoretic Measure of Argument Strength for Abstract Argumentation. In: Hölldobler, S., Lutz, C., Wansing, H. (eds) Logics in Artificial Intelligence. JELIA 2008. Lecture Notes in Computer Science(), vol 5293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87803-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-87803-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87802-5
Online ISBN: 978-3-540-87803-2
eBook Packages: Computer ScienceComputer Science (R0)