This is the website of the AMANDE project (1/Dec/2013 - 30/Nov/2017).



Defining Richer Argumentation Systems


The aim of this WP is to define a new generation of argumentation systems that underpin the services that are emerging as core functions of multiparty argumentation. These include generation and evaluation of arguments, and selection of arguments to put forward. For this purpose, we will develop an axiomatic approach where axioms are the desirable properties that the new systems should satisfy.


In [Dung95], deliberation is somewhat “simplistic”, as it classifies arguments into two categories only: acceptable and unacceptable arguments. Several works, (e.g., [BH01,CL05,MT08]) have considered and explored the possibility of discriminating between arguments using a larger number of categories or continuous numerical scales. Under this approach, the argumentation process is divided into two steps: a valuation of the relative strength of the arguments, and then the selection of the most acceptable ones. In the valuation step, it is usual to distinguish two different types of valuations: intrinsic valuation, where the value of an argument is independent of its interactions with the other arguments (e.g.,[Pollock92,PS97]); interaction-based valuation, where the value of an argument depends on its attackers [BH01,CL05]. Recently [MT08] have proposed a measure of strength of arguments using the paradigm of non-cooperative game theory.


1. Classification of arguments
In usual argumentation semantics, arguments are accepted or rejected. In a multiparty argumentation point of view, it is likely that an agent will not be able to communicate all the information she wants, and will have to focus on the most “important” arguments. So being able to classify arguments with respect to a finer scale than a binary one is needed. One idea in the line of the interaction-based valuation is to account for the value of arguments using power indices applied to particular cooperative games, where the strength of all (likely)

coalitions of arguments and the respective attack/defence branches are considered. First, a coalitional game (see e.g. [Owen95]) representing the relevant information about attacks and defences to arguments inside (or outside) coalitions of arguments, is constructed. Second, power indices [SS54,Owen95,MP08] may be used to convert the information about the strength of attacks and defences of coalitions of arguments into a single valuation of each argument. We plan to compare the different assumptions made in our approach to support the use of power indices for arguments valuation by means of an axiomatic approach. E.g., one intuitive property that an argument valuation should satisfy is that the dialectical properties of admissibility and stability should confer more strength to an argument in a dispute. As was observed in [MT08], the measures of [BH01,CL05] do not satisfy in general this property

2. Classification of attacks
Another objective of this WP is to explore the possibility to quantitatively evaluate the strength of the attacks. [DHM09] have introduced a natural extension of Dung’s argumentation framework in which attacks are associated with a weight, indicating the relative strength of the attack. In this model, no specific

interpretation of weights is demanded, and the authors suggest a possible interpretation of weights in a multi agent setting in terms of the number of votes that support the attack. However, as it is well known from the theory of voting systems, the number of votes does not necessarily represent the importance of an attack. In addition, the configurations of links associated to an abstract argumentation framework provide information about which multiple attacks are feasible, and this information should be considered in the computation of the strength of attacks. In order to integrate the information about the votes of agents with the information about the restriction on the feasibility of multiple attacks provided by an abstract argumentation framework, we may make use of coalitional games with restriction in cooperation [BOT92].

3. Revision of an argumentation system
agent accepts a new argument or attacks during her interactions with other agents. This problem has been preliminary studied in some papers (e.g. [CDL08]). Revision operations will be analyzed with respect to the changes induced [AGM85] by new arguments and attacks on the valuation performed using power indices.

Inspired by monotonicity results for solutions in coalitional games [Sprumont90, Moretti08], it will be interesting to investigate monotonicity properties of a valuation method when new elements are added to an argumentation system. E.g., it would be counter-intuitive to define revision operations based on valuation that allocate less (more) strength to an argument when some of the attacks directed to such an argument are removed (added).


[Arrow51] K. Arrow. Social Choice and Individual Values. Wiley, NY, 1951/1963.
[BF04] S. Brams and P. Fishburn. Voting procedures. In K. Arrow, A. Sen, and K. Suzumura (eds.), Handbook of Social Choice and Welfare, chapter 4. Elsevier, 2004.
[Caminada06] M.W.A. Caminada. On the issue of reinstatement in argumentation. In 10th European Conference, JELIA 2006, LNAI 4160, pp.111-123, 2006.
[CDKLM07] S. Coste-Marquis, C. Devred, S. Konieczny, M.-C. Lagasquie-Schiex, and P. Marquis. On the merging of Dung’s argumentation systems. Artificial Intelligence, 171: 730–753, 2007
[CELM07] Y. Chevaleyre, U. Endriss, J. Lang, and N. Maudet. A short introduction to computational social choice. Proc. SOFSEM-2007, Springer-Verlag, 2007.
[CG09] M.W.A. Caminada and D.M. Gabbay. A logical account of formal argumentation. Studia Logica, 93(2-3): 109-145, 2009.
[CP11] M.W.A. Caminada and G. Pigozzi. On judgment aggregation in abstract argumentation. JAAMAS, 22: 64-102, 2011.
[CPP11] M. Caminada, G. Pigozzi, and M. Podlaszewski. Manipulation in group argument evaluation. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 121-126, 2011.
[DH10] E. Dokow and R. Holzman. Aggregation of binary evaluations with abstentions. Journal of Economic Theory, 145(2): 544-561, 2010.
[DMW12] P.E. Dunne, P. Marquis, M. Wooldridge. Argument Aggregation: Basic Axioms and Complexity Results Proceedings of the 4th International Conference on Computational Models of Argument (COMMA'12), Vienna, p. 129-140, 2012.
[Gibbard73] A. Gibbard. Manipulation of voting schemes. Econometrica, 41:587-602, 1973.
[KG06] S. Konieczny and E. Grégoire. Logic-based approaches to information fusion. Information Fusion, 7: 4–18, 2006.
[KP02] S. Konieczny and R. Pino Pérez. Merging information under constraints: a qualitative framework. Journal of Logic and Computation, 12(5): 773-808, 2002.
[LP09] C. List and C. Puppe. Judgment aggregation: A survey. In Oxford Handbook of Rational and Social Choice. Oxford University Press (New York), 2009.
[LP10] C. List and B. Polak. Introduction to judgment aggregation. Journal of Economic Theory, 145(2):441-466, 2010.
[RL08] I. Rahwan and K. Larson. Welfare properties of argumentation-based semantics. In Proc. of AAAI 2008, pp. 150-155, 2008.
[RT10] I. Rahwan and F. Tohmé. Collective argument evaluation as judgment aggregation. In Proc. of AAMAS 2010, pp. 417–424, 2010.
[Satterthwaite75] M. Satterthwaite. Strategyproofness and Arrow’s conditions. Journal of Economic Theory, 10: 187-217, 1975.
[TBS08] F.A. Tohmé, G. A. Bodanza, and G. R. Simari. Aggregation of attack relations: A social-choice theoretical analysis of defeasibility criteria. In Proc. of FoIKS, 8-23, 2008.