Polynomial-time updates of epistemic states in a fragment of probabilistic epistemic argumentation

Potyka, Nico, Polberg, Sylwia and Hunter, Anthony 2019. Polynomial-time updates of epistemic states in a fragment of probabilistic epistemic argumentation. Presented at: 15th European Conference, ECSQARU 2019, Belgrade, 18-20 September 2019. Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Symbolic and Quantitative Approaches to Reasoning with Uncertainty ECSQARU 2019. , vol.11726 pp. 74-86. 10.1007/978-3-030-29765-7_7

Full text not available from this repository.

Abstract

Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way that is well founded by probability theory. Epistemic states are represented by probability functions over possible worlds and can be adjusted to new beliefs using update operators. While the use of probability functions puts this approach on a solid foundational basis, it also causes computational challenges as the amount of data to process depends exponentially on the number of arguments. This leads to bottlenecks in applications such as modelling opponent’s beliefs for persuasion dialogues. We show how update operators over probability functions can be related to update operators over much more compact representations that allow polynomial-time updates. We discuss the cognitive and probabilistic-logical plausibility of this approach and demonstrate its applicability in computational persuasion.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
ISSN:	0302-9743
Last Modified:	27 Jun 2023 15:30
URI:	https://orca.cardiff.ac.uk/id/eprint/160227

Actions (repository staff only)

Edit Item