A model-based theorem prover for epistemic graphs for argumentation

Hunter, Anthony and Polberg, Sylwia ORCID: https://orcid.org/0000-0002-0811-0226 2019. A model-based theorem prover for epistemic graphs for argumentation. Presented at: 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2019), Belgrade, Serbia, 18-20 September 2019. Published in: Kern-Isberner, Gabriele and Ognjanović, Zoran eds. Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Lecture Notes in Computer Science , vol.11726 Springer Cham, pp. 50-61. 10.1007/978-3-030-29765-7_5

Preview

PDF - Accepted Post-Print Version Download (463kB) | Preview

Abstract

Epistemic graphs are a recent proposal for probabilistic argumentation that allows for modelling an agent’s degree of belief in an argument and how belief in one argument may influence the belief in other arguments. These beliefs are represented by probability distributions and how they affect each other is represented by logical constraints on these distributions. Within the full language of epistemic constraints, we distinguish a restricted class which offers computational benefits while still being powerful enough to allow for handling of many other argumentation formalisms and that can be used in applications that, for instance, rely on Likert scales. In this paper, we propose a model-based theorem prover for reasoning with the restricted epistemic language.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Publisher:	Springer Cham
ISBN:	978-3-030-29764-0
Date of First Compliant Deposit:	6 July 2019
Date of Acceptance:	11 June 2019
Last Modified:	08 Aug 2025 14:50
URI:	https://orca.cardiff.ac.uk/id/eprint/124050

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item