Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract)
Abstract
The complexity of the probabilistic counterparts of the verification and acceptance problems is investigated over probabilistic Abstract Argumentation Frameworks (prAAFs), in a setting more general than the literature, where the complexity has been characterized only under independence between arguments/defeats. The complexity of these problems is shown to depend on the semantics of the extensions, the way of encoding the prAAF, and the correlations between arguments/defeats. In this regard, in order to study the impact of different correlations between arguments/defeats on the complexity, a new form of prAAF is introduced, called gen. It is based on the well-known paradigm of world-set sets, and it allows the correlations to be easily distinguishable.
Cite
Text
Fazzinga et al. "Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/888Markdown
[Fazzinga et al. "Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/fazzinga2019ijcai-complexity/) doi:10.24963/IJCAI.2019/888BibTeX
@inproceedings{fazzinga2019ijcai-complexity,
title = {{Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract)}},
author = {Fazzinga, Bettina and Flesca, Sergio and Furfaro, Filippo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {6362-6366},
doi = {10.24963/IJCAI.2019/888},
url = {https://mlanthology.org/ijcai/2019/fazzinga2019ijcai-complexity/}
}