Hunter, A;
(2022)
Automated Reasoning with Epistemic Graphs Using SAT Solvers.
In: Toni, F and Polberg, S and Booth, R and Caminada, M and Kido, H, (eds.)
Computational Models of Argument.
(pp. pp. 176-187).
IOS Press: Amsterdam, Netherlands.
Preview |
Text
FAIA-353-FAIA220151.pdf - Published Version Download (298kB) | Preview |
Abstract
Epistemic graphs have been developed 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 constraints on probability distributions. In this paper, we present a framework for reasoning with epistemic graphs that allows for beliefs for individual arguments to be determined given beliefs in some of the other arguments. We present and evaluate algorithms based on SAT solvers.
Type: | Proceedings paper |
---|---|
Title: | Automated Reasoning with Epistemic Graphs Using SAT Solvers |
Event: | Third Conference on Computational Models of Argument |
ISBN-13: | 978-1-64368-306-5 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.3233/FAIA220151 |
Publisher version: | https://doi.org/10.3233/FAIA220151 |
Language: | English |
Additional information: | This is an Open Access paper published under a Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) Licence (https://creativecommons.org/licenses/by-nc/4.0/). |
UCL classification: | 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 UCL > Provost and Vice Provost Offices > UCL BEAMS UCL |
URI: | https://discovery.ucl.ac.uk/id/eprint/10158040 |




Archive Staff Only
![]() |
View Item |