Averaging Solution of Differential Equations as Value for Argumentation Graph with Similarity

In this paper, we present a new method to get the value of claims and relations of an argumentation graph. By the method, the values of claims and relations are determined by the average of the solutions of the differential equation derived from the argumentation graph. We show that the overhead of...

Full description

Saved in:
Bibliographic Details
Published inProcedia computer science Vol. 207; pp. 614 - 623
Main Authors Yamaguchi, Kazunori, Matsuda, Yoshitatsu, Morinaga, Yuya
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2022
Subjects
argumentation
attack
differential equation
recursive relation
similarity
support
value
differential equation
argumentation
recursive relation
attack
similarity
support
value
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a new method to get the value of claims and relations of an argumentation graph. By the method, the values of claims and relations are determined by the average of the solutions of the differential equation derived from the argumentation graph. We show that the overhead of obtaining multiple solutions can be reduced by parallel execution and the values obtained by the method agree with our intuition. We can get a confidence interval of each value and a rough grouping of claims and relations by the method. We show the results for toy graphs, large artificial graphs, and a natural language argumentation graph.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2022.09.116