Probabilistic argumentation frameworks
Probabilistic argumentation frameworks
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.
1-16
Li, Hengfei
51be5635-5648-4d6d-85f8-f7191929ef79
Oren, Nir
00646ccd-977b-4442-88c7-d18089b26670
Norman, Timothy J.
663e522f-807c-4569-9201-dc141c8eb50d
2012
Li, Hengfei
51be5635-5648-4d6d-85f8-f7191929ef79
Oren, Nir
00646ccd-977b-4442-88c7-d18089b26670
Norman, Timothy J.
663e522f-807c-4569-9201-dc141c8eb50d
Li, Hengfei, Oren, Nir and Norman, Timothy J.
(2012)
Probabilistic argumentation frameworks.
In Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers.
vol. 7132 LNAI,
.
(doi:10.1007/978-3-642-29184-5_1).
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
This record has no associated files available for download.
More information
Published date: 2012
Venue - Dates:
1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011, , Barcelona, Spain, 2011-07-16 - 2011-07-17
Identifiers
Local EPrints ID: 469191
URI: http://eprints.soton.ac.uk/id/eprint/469191
ISSN: 0302-9743
PURE UUID: c589ef39-b27e-493b-8935-968e34cfe1ca
Catalogue record
Date deposited: 08 Sep 2022 17:29
Last modified: 17 Mar 2024 03:41
Export record
Altmetrics
Contributors
Author:
Hengfei Li
Author:
Nir Oren
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
