Name
Abstract | ||
|---|---|---|
Combining computational models of argumentation with probability theory has recently gained increasing attention, in particular with respect to abstract argumentation frameworks. Approaches following this idea can be categorised into the constellations and the epistemic approach. While the former considers probability functions on the subgraphs of abstract argumentation frameworks, the latter uses probability theory to represent degrees of belief in arguments, given a fixed framework. In this paper, we investigate the case where probability functions are given on the extensions of abstract argumentation frameworks. This generalises classical semantics in a straightforward fashion and we show that our approach also complies with many postulates for epistemic probabilistic argumentation. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-75553-3_7 | Lecture Notes in Artificial Intelligence |
DocType | Volume | ISSN |
Conference | 10757 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Thimm | 1 | 574 | 58.87 |
| Pietro Baroni | 2 | 722 | 50.00 |
| Massimiliano Giacomin | 3 | 785 | 54.15 |
| Paolo Vicig | 4 | 160 | 23.24 |