Evaluation of Arguments in Weighted Bipolar Graphs
Résumé
The paper tackled the issue of arguments evaluation in weighted bipo-lar argumentation graphs (i.e., graphs whose arguments have basic strengths, and may be both supported and attacked). We introduce axioms that an evaluation method (or semantics) could satisfy. Such axioms are very useful for judging and comparing semantics. We then analyze existing semantics on the basis of our axioms, and finally propose a new semantics for the class of acyclic graphs.
Domaines
Intelligence artificielle [cs.AI]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...