TY  - GEN
KW  - Argument strength
KW  -  Probabilistic argumentation
KW  -  Deductive argumentation
KW  -  Defeasible logic
T3  - Lecture Notes in Computer Science
A1  - Hunter, A
CY  - Cham, Switzerland
UR  - https://doi.org/10.1007/978-3-030-86772-0_6
PB  - Springer
ID  - discovery10137299
N2  - It is common for people to remark that a particular argument is a strong (or weak) argument. Having a handle on the relative strengths of arguments can help in deciding on which arguments to consider, and on which to present to others in a discussion. In computational models of argument, there is a need for a deeper understanding of argument strength. Our approach in this paper is to draw on confirmation theory for quantifying argument strength, and harness this in a framework based on probabilistic argumentation. We show how we can calculate strength based on the structure of the argument involving defeasible rules. The insights appear transferable to a variety of other structured argumentation systems.
N1  - This version is the author accepted manuscript. For information on re-use, please refer to the publisher?s terms and conditions.
EP  - 88
AV  - public
SP  - 74
Y1  - 2021/09/19/
TI  - Argument Strength in Probabilistic Argumentation Using Confirmation Theory
ER  -