2011
DOI: 10.1007/978-3-642-21940-5_8
|View full text |Cite
|
Sign up to set email alerts
|

On a Computational Argumentation Framework for Agent Societies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
3
3

Relationship

4
2

Authors

Journals

citations
Cited by 11 publications
(15 citation statements)
references
References 43 publications
(46 reference statements)
0
15
0
Order By: Relevance
“…The evolution is validated by the TT that receives the argument based on the case database. The scheme followed is based on the argumentation model described in [9].…”
Section: Argumentation Modelmentioning
confidence: 99%
“…The evolution is validated by the TT that receives the argument based on the case database. The scheme followed is based on the argumentation model described in [9].…”
Section: Argumentation Modelmentioning
confidence: 99%
“…In this section, we briefly introduce the argumentation framework that allow us to develop the case-based dialogue strategies presented in this paper (a detailed explanation can be found in [19,Chapter 3]). This framework has been implemented as an argumentation API in the Magentix2 agent platform and is publicly available at http://www.gti-ia.upv.es/sma/tools/magentix2/.…”
Section: Case-based Argumentation Frameworkmentioning
confidence: 99%
“…To illustrate part of the case-based reasoning process proposed in our framework, Algorithm 2.1 shows the pseudocode of the algorithm that implements the generation and selection of positions. The whole process to manage positions and arguments is detailed in [19,Chapter 3]. In the algorithm, the function generatePositions generates the n first positions (or all possible positions if they are less than n) by retrieving a list of past similar domain-cases and reusing their solutions (actually, the function uses the Euclidean distance to retrieve similar cases and then copies the solutions of these cases, although alternative retrieving and reusing techniques could be considered); retrieveArgumentCases is a function that retrieves for each position the list of argument-cases that represent arguments that were used to attack or support a similar position with a similar social context (again using the Euclidean distance); computeSimilarityDegree is a function that computes a degree of similarity (SimD) of each position generated with regard to the problem to solve (by using the Euclidean distance or an algorithm that computes the semantic distance between ontological concepts); computeSF, is a function that computes the support factor (SF) of each position by using the formula explained before; selectPosition is a domain-dependent function that orders the set of positions from more to less suitable with respect to some domain-dependent criteria, taking into account their similarity degree and support factor; and mostSuitable is a domain-dependent function that returns the most suitable position to solve the problem.…”
Section: Argument-casementioning
confidence: 99%
“…Commonly, the term agent society is used in the Argumentation and Artificial Intelligence (AI) literature as a synonym for an agent organisation [11] or a group of agents that play specific roles, follow certain interaction patterns, and collaborate to reach global objectives [23]. Our notion of agents' social context in an argumentation process includes information related to the proponent and the opponent of an argument, the group that these agents belong to, the dependency relation that they have, and the values that they want to promote [14]. Therefore, we endorse the view of value-based argumentation frameworks [6] [5], which stress the importance of the audience in determining whether or not an argument is persuasive.…”
Section: Introductionmentioning
confidence: 99%