2021
DOI: 10.1007/978-3-030-77091-4_10
|View full text |Cite
|
Sign up to set email alerts
|

Towards an Implementation of a Concurrent Language for Argumentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
8
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(10 citation statements)
references
References 12 publications
1
8
0
1
Order By: Relevance
“…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.…”
Section: Bistarelli and C Taticchi / A Concurrent Language For Modell...supporting
confidence: 70%
See 1 more Smart Citation
“…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.…”
Section: Bistarelli and C Taticchi / A Concurrent Language For Modell...supporting
confidence: 70%
“…The language was first presented in [16], where we defined an early version of the cla syntax and operational semantics. Next, we introduced with [17] a prototype…”
Section: Bistarelli and C Taticchi / A Concurrent Language For Modell...mentioning
confidence: 99%
“…The landscape of argumentation-based chatbots has seen an increase in interest in recent years. For example, ArguBot (Bistarelli et al, 2021), developed using Google DialogFlow, employs ASPARTIX to compute arguments from an underlying Bipolar AF, or BAF, (Cayrol and Lagasquie-Schiex, 2005) to support or challenge the user's opinion about a dialog topic. The conversational capabilities of ArguBot are, however, restricted by the arguments stored in the BAF as its knowledge base, limiting its dialectical potential only to specific fully-developed interactions.…”
Section: Discussionmentioning
confidence: 99%
“…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.…”
Section: Syntax and Semanticsmentioning
confidence: 99%
“…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.…”
Section: Introductionmentioning
confidence: 99%