Name
Abstract | ||
|---|---|---|
Dung’s Argumentation Framework (AF) has been extended in several directions, including the possibility of representing unquantified uncertainty about the existence of arguments and attacks.The framework resulting from such an extension is called incomplete AF (iAF). In this paper, we first introduce three new satisfaction problems named totality, determinism and functionality, and investigate their computational complexity for both AF and iAF under several semantics.We also investigate the complexity of credulous and skeptical acceptance in iAF under semi-stable semantics—a problem left open in the literature.We then show that any iAF can be rewritten into an equivalent one where either only (unattacked) arguments or only attacks are uncertain. Finally, we relate iAF to probabilistic argumentation framework, where uncertainty is quantified. |
Year | Venue | Keywords |
|---|---|---|
2022 | AAAI Conference on Artificial Intelligence | Knowledge Representation And Reasoning (KRR) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gianvincenzo Alfano | 1 | 8 | 7.17 |
| Sergio Greco | 2 | 1249 | 265.35 |
| Francesco Parisi | 3 | 207 | 19.15 |
| Irina Trubitsyna | 4 | 119 | 24.66 |