id: 06069083
dt: a
an: 06069083
au: Li, Hengfei; Oren, Nir; Norman, Timothy J.
ti: Probabilistic argumentation frameworks.
so: Modgil, Sanjay (ed.) et al., Theory and applications of formal
    argumentation. First international workshop, TAFA 2011. Barcelona,
    Spain, July 16‒17, 2011. Revised selected papers. Berlin: Springer
    (ISBN 978-3-642-29183-8/pbk). Lecture Notes in Computer Science 7132.
    Lecture Notes in Artificial Intelligence, 1-16 (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-29184-5_1
ab: Summary: In this paper, we extend Dung’s seminal argument framework to
    form a probabilistic argument framework by associating probabilities
    with arguments and defeats. We then compute the likelihood of some set
    of arguments appearing within an arbitrary argument framework induced
    from this probabilistic framework. We show that the complexity of
    computing this likelihood precisely is exponential in the number of
    arguments and defeats, and thus describe an approximate approach to
    computing these likelihoods based on Monte-Carlo simulation. Evaluating
    the latter approach against the exact approach shows significant
    computational savings. Our probabilistic argument framework is
    applicable to a number of real world problems; we show its utility by
    applying it to the problem of coalition formation.
rv: