Bipolar Weighted Argumentation Graphs
Till Mossakowski, Fabian Neuhaus

TL;DR
This paper explores the semantics of bipolar weighted argumentation graphs, which include both support and attack relations, extending previous work on unipolar graphs to handle more complex argument structures.
Contribution
It introduces a framework for analyzing bipolar argumentation graphs, combining support and attack semantics, building upon prior models that considered only one type of relation.
Findings
Develops semantics for bipolar argumentation graphs
Extends existing models to include support and attack
Provides a unified approach for bipolar argumentation analysis
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Agent Systems and Negotiation · Access Control and Trust · Business Process Modeling and Analysis
