Pierre Monnin

Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks

This paper presents fast and exact methods for computing the probability of an argument’s acceptance using Dung’s semantics in the Constellation paradigm of Abstract Argumentation. For (directed) Singly-Connected Graphs (SCGs), the problem can now be solved in linearithmic time instead of being expo…