Evaluation of Arguments in Weighted Bipolar Graphs 1

Abstract : The paper tackled the issue of arguments evaluation in weighted bipolar argumen-tation graphs (i.e., graphs whose arguments have basic strengths, and may be both supported and attacked). We introduce principles that an evaluation method (or semantics) could satisfy. Such principles are very useful for understanding the foundations of semantics, judging them, and comparing semantics. We then analyze existing semantics on the basis of our principles, and finally propose a new semantics for the class of acyclic graphs. We show that it satisfies all the principles.
Document type :
Journal articles
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02325836
Contributor : Leila Amgoud <>
Submitted on : Tuesday, October 22, 2019 - 12:55:09 PM
Last modification on : Saturday, October 26, 2019 - 2:06:26 AM

File

Amgoud-Bennaim.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02325836, version 1

Citation

Leila Amgoud, Jonathan Ben-Naim. Evaluation of Arguments in Weighted Bipolar Graphs 1. International Journal of Approximate Reasoning., 2018. ⟨hal-02325836⟩

Share

Metrics

Record views

18

Files downloads

20