Bipolar Weighted Argumentation Graphs

11/25/2016
by   Till Mossakowski, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset