Introducing a Tool for Concurrent Argumentation

A concurrent language for modelling agents arguing on a shared argumentation space

“…The present work summarises and extends a series of previous studies [16][17][18][19]45] which led to the conceptualisation and development of cla. The language was first presented in [16], where we defined an early version of the cla syntax and operational semantics.…”

“…Bistarelli and C. Taticchi / A concurrent language for modelling arguing agents 3 implementation, and in [18] we showed examples of how to obtain belief revision operations via the constructs of our language. A user interface was then provided in [19] together with some examples of execution. A very brief overview of the work was also presented in [45].…”

Timed Concurrent Language for Argumentation: An Interleaving Approach

“…The communication between tcla agents is implemented via shared memory, similarly to cla - [10,11] -and CC - [47] -and opposed to other languages as CSP - [27] -and CCS - [32] -which are based on message passing. We denote by E the class of guarded agents and by E 0 the class of guarded agents such that all outermost guards have t = 0.…”

“…We now compare the interleaving-based implementation of tcla reported in this paper with the approach presented in [9,11] where maximum parallelism is used for allowing parallel execution of an infinite number of concurrent agents. We use an example to illustrate how the two versions handle actions in parallel constructs differently.…”

“…In [9], we introduced tcla, a timed extension of the Concurrent Language for Argumentation - [10,11,13] -which models dynamic interactions between agents using basic actions like add, rmv, check and test, and exploits notions from Argumentation Theory to reason about shared knowledge. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…”