Bipolar Weighted Argumentation Graphs
Not on the map. Why?
Abstract (arXiv)
This paper discusses the semantics of weighted argumentation graphs that are biplor, i.e. contain both attacks and support graphs. The work builds on previous work by Amgoud, Ben-Naim et. al., which presents and compares several semantics for argumentation graphs that contain only supports or only attacks relationships, respectively.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 25 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022The Inverse Problem for Argumentation Gradual Semanticscited by 2
- 2022The Inverse Problem for Argumentation Gradual Semantics1 Feb 2022