AINov 25, 2016
Bipolar Weighted Argumentation Graphs
arXiv:1611.08572v212 citations
Originality Synthesis-oriented
AI Analysis
This work addresses a theoretical gap in argumentation frameworks for AI and logic, but appears incremental as it extends existing semantics to combined structures.
The paper tackles the semantics of bipolar weighted argumentation graphs, which include both attacks and supports, building on prior work that separately handled these relationships.
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.