Constructing Bayesian Network Graphs from Labeled Arguments

Publication date

2019-08-28

Authors

Wieten, RemiISNI 0000000492960331
Bex, FlorisORCID 0000-0002-5699-9656ISNI 0000000118066508
Prakken, HenryISNI 000000011466763X
Renooij, SiljaORCID 0000-0003-4339-8146ISNI 0000000396172124

Editors

Kern-Isberner, Gabriele
Ognjanović, Zoran

Advisors

Supervisors

Document Type

Part of book
Open Access logo

License

taverne

Abstract

Bayesian networks (BNs) are powerful tools that are well-suited for reasoning about the uncertain consequences that can be inferred from evidence. Domain experts, however, typically do not have the expertise to construct BNs and instead resort to using other tools such as argument diagrams and mind maps. Recently, a structured approach was proposed to construct a BN graph from arguments annotated with causality information. As argumentative inferences may not be causal, we generalize this approach to include other types of inferences in this paper. Moreover, we prove a number of formal properties of the generalized approach and identify assumptions under which the construction of an initial BN graph can be fully automated.

Keywords

Bayesian networks, Argumentation, Inference, Reasoning, Taverne

Citation

Wieten, R, Bex, F, Prakken, H & Renooij, S 2019, Constructing Bayesian Network Graphs from Labeled Arguments. in G Kern-Isberner & Z Ognjanović (eds), Symbolic and Quantitative Approaches to Reasoning with Uncertainty : 15th European Conference, ECSQARU 2019, Belgrade, Serbia, September 18-20, 2019, Proceedings. 1 edn, Lecture Notes in Computer Science, vol. 11726, Springer, pp. 99-110. https://doi.org/10.1007/978-3-030-29765-7_9