Bipolar Weighted Argumentation Graphs
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Modular Semantics and Characteristics for Bipolar Weighted Argumentation Graphs
This paper addresses the semantics of weighted argumentation graphs that are bipolar, i.e. contain both attacks and supports for arguments. It builds on previous work by Amgoud, Ben-Naim et. al. We study the various char…
AllA Tutorial for Weighted Bipolar Argumentation with Continuous Dynamical Systems and the Java Library Attractor
Weighted bipolar argumentation frameworks allow modeling decision problems and online discussions by defining arguments and their relationships. The strength of arguments can be computed based on an initial weight and th…
Extending Modular Semantics for Bipolar Weighted Argumentation (Technical Report)
Weighted bipolar argumentation frameworks offer a tool for decision support and social media analysis. Arguments are evaluated by an iterative procedure that takes initial weights and attack and support relations into ac…
Contribution Functions for Quantitative Bipolar Argumentation Graphs: A Principle-based Analysis
We present a principle-based analysis of contribution functions for quantitative bipolar argumentation graphs that quantify the contribution of one argument to another. The introduced principles formalise the intuitions …
Towards a Benchmark of Natural Language Arguments
The connections among natural language processing and argumentation theory are becoming stronger in the latest years, with a growing amount of works going in this direction, in different scenarios and applying heterogene…
Abstract ArgumentationNatural Language Inference