Potyka, N;
Polberg, S;
Hunter, A;
(2019)
Polynomial-Time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation.
In: Kern-Isberner, G and Ognjanović, Z, (eds.)
Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2019. Lecture Notes in Computer Science, vol 11726.
(pp. pp. 74-86).
Springer: Cham.
Preview |
Text
Hunter_Polynomial-time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation_AAM.pdf - Accepted Version Download (298kB) | Preview |
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.
Type: | Proceedings paper |
---|---|
Title: | Polynomial-Time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation |
Event: | European Conference on Quantitative and Symbolic Approaches to Reasoning with Uncertainty |
ISBN: | 978-3-030-29765-7 |
ISBN-13: | 978-3-030-29764-0 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1007/978-3-030-29765-7_7 |
Publisher version: | https://doi.org/10.1007/978-3-030-29765-7_7 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10076707 |
Archive Staff Only
View Item |