Recently, there has been a proposal by Dung and Thang and by Li et al to extend abstract argumentation to take uncertainty of arguments into account by assigning a probability value to each argument, and then use this assignment to determine the probability that a set of arguments is an extension. In this paper, we explore some of the assumptions behind the definitions, and some of the resulting properties, of the proposal for probabilistic argument graphs.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org