Probabilistic Argumentation, a Small Step for Uncertainty, a Giant Step for Complexity

Abstract In this paper we study how the restrictions of probability function affects the complexity in probabilistic argumentation. Our results show that the complexity of computing the probability of acceptance can only become tractable when we impose very strong restrictions on the probability function. Even a tiny relaxation of the restriction dramatically increases the complexity.

Authors

• Xin Sun 0001
• Beishui Liao

Keywords

No keywords are indexed for this paper.