While agent-based modelling languages naturally implement concurrency, the currently available languages for argumentation do not allow to explicitly model this type of interaction. In this paper we introduce a concurrent language for handling agents arguing and communicating using a shared argumentation space. We also show how to perform high-level operations like persuasion and negotiation through basic belief revision constructs, and present a working implementation of the language and the associated web interface.

This paper introduces a generic agent-based model simulating the exchange and the diffusion of pro and con arguments. It is applied to the case of the diffusion of vegetarian diets in the context of a potential emergence of a second nutrition transition. To this day, agent-based simulation has been extensively used to study opinion dynamics. However, the vast majority of existing models have been limited to extremely abstract and simplified representations of the diffusion process. These simplifications impairs the realism of (...) the simulations and disables the understanding of the reasons for the shift of an actor's opinion. The generic model presented here explicitly represents exchanges of arguments between actors in the context of an opinion dynamic model. In particular, the inner attitude towards an opinion of each agent is formalized as an argumentation graph and each agent can share arguments with other agents. Simulation experiments show that introducing attacks between arguments and a limitation of the number of arguments mobilized by agents has a strong impact on the evolution of the agents' opinion. We also highlight that when a new argument is introduced into the system, the quantity and the profile of the agents receiving the new argument will impact the evolution of the overall opinion. Finally, the application of this model to vegetarian diet adoption seems consistent with historical food behaviour dynamics observed during crises. (shrink)

This article investigates to what extent protocols for dynamicdisputes, i.e., disputes in which the information base can vary at differentstages, can be justified in terms of logics for defeasible argumentation. Firsta general framework is formulated for dialectical proof theories for suchlogics. Then this framework is adapted to serve as a framework for protocols fordynamic disputes, after which soundness and fairness properties are formulated for such protocols relative to dialectical proof theories. It then turns out that certaintypes of protocols that are (...) perfectly fine with a static information base, arenot sound or fair in a dynamic setting. Finally, a natural dynamic protocolis defined for which soundness and fairness can be established. (shrink)

Over the last decade, several extensions of Dung’s Abstract Argumentation Frameworks (AFs) have been introduced in the literature. Some of these extensions concern the nature of the attack relation, such as the consideration of recursive attacks, whereas others incorporate additional interactions, such as a support relation. Recently, the Attack–Support Argumentation Framework (ASAF) was proposed, which accounts for recursive attacks and supports, attacks to supports and supports to attacks, at any level, where the support relation is interpreted as necessity. Currently, to (...) determine the accepted elements of an ASAF (which may be arguments, attacks, and supports) it is required to translate such an ASAF into a Dung’s AF. In this work, we provide a formal characterization of acceptability semantics directly on the ASAF, without requiring such a translation. We prove that our characterization is sound since it satisfies different results from Dung’s argumentation theory; moreover, we formally show that the approach proposed here for addressing acceptability is equivalent to the preexisting one, in which the ASAF was translated into an AF. Also, we formalize the relationship between the ASAF and other frameworks on which it is inspired: the Argumentation Framework with Recursive Attacks (AFRA) and the Argumentation Framework with Necessities (AFN). (shrink)

We developed an on-line intelligent argumentation system which facilitates stakeholders in exchanging dialogues. It provides decision support by capturing stakeholders’ rationale through arguments. As part of the argumentation process, stakeholders tend to both polarise their opinions and form polarisation groups. The challenging issue of assessing argumentation polarisation had not been addressed in argumentation systems until recently. Arvapally, Liu, and Jiang [, ‘Identification of Faction Groups and Leaders in Web-Based Intelligent Argumentation System for Collaborative Decision Support’, in Proceedings of International Conference (...) on Collaborative Technologies and Systems] earlier developed a method to identify polarisation groups. These groups, however, tend to overlap to a certain degree; each stakeholder may be a member of multiple polarisation groups to varied degrees. Quantifying stakeholders’ membership in multiple polarisation groups is an important issue in the argumentation for collaborative decision-making, which is not addressed earlier. We present a novel approach using fuzzy clustering algorithm to address this issue in this article. The method is evaluated using data sets produced from the discussions of 24 stakeholders. Experimental results indicate that our method is effective for both identifying polarisation groups and quantifying stakeholders’ degree of membership in each polarisation group. (shrink)