Weighted Bipolar Argumentation Graphs: Axioms and Semantics
Résumé
The paper studies how arguments can be eval-uated inweighted bipolar argumentation graphs(i.e., graphs whose arguments have basic weightsand may be supported and attacked). It introducesprinciplesthat an evaluation method (orsemantics)would satisfy, analyzes existing semantics with re-spect to them, and finally proposes a new semanticsfor the class of non-maximal acyclic graph
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|