ProbLog is a popular probabilistic logic programming language and tool, widely used for applications requiring to deal with inherent uncertainties in structured domains. In this paper we study some
connections between ProbLog and a variant of another well-known formalism combining symbolic
reasoning and reasoning under uncertainty, namely probabilistic argumentation. Specifically, we
show that ProbLog is an instance of a form of Probabilistic Abstract Argumentation (PAA) under
the constellation approach, which builds upon Assumption-Based Argumentation (ABA). The connections pave the way towards equipping ProbLog with a variety of alternative semantics, inherited
from PAA/PABA, as well as obtaining novel argumentation semantics for PAA/PABA, leveraging on
existing connections between ProbLog and argumentation. Moreover, the connections pave the way
towards novel forms of argumentative explanations for ProbLog’s outputs.