A polynomial-time fragment of epistemic probabilistic argumentation

Potyka, Nico 2019. A polynomial-time fragment of epistemic probabilistic argumentation. International Journal of Approximate Reasoning: Uncertainty in Intelligent Systems 115 , pp. 265-289. 10.1016/j.ijar.2019.10.005

Full text not available from this repository.

Abstract

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding an exponential number of terms. We show that this exponential blowup can be avoided in an interesting fragment of epistemic probabilistic argumentation and that some computational problems that have been considered intractable can be solved in polynomial time. We give efficient convex programming formulations for these problems and explore how far our fragment can be extended without losing tractability.

Item Type:	Article
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Elsevier
ISSN:	0888-613X
Date of Acceptance:	7 October 2019
Last Modified:	28 Jun 2023 09:30
URI:	https://orca.cardiff.ac.uk/id/eprint/160231

Actions (repository staff only)

Edit Item