# A Polynomial-time Fragment of Epistemic Probabilistic Argumentation (Technical Report)

arXiv: https://arxiv.org/abs/1811.12083 · HTML: https://mlsanity.com/paper/1811.12083/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Nov 2018.

## Built on by (most cited first, 1 of 1)

- [Strategic Argumentation Dialogues for Persuasion: Framework and Experiments Based on Modelling the Beliefs and Concerns of the Persuadee](https://mlsanity.com/paper/2101.11870/) (2021)

## Abstract (arXiv)

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 loosing tractability.