@inproceedings{4242d4ae25d246f0a4bffd81d04db0b0,
title = "Expressiveness of SETAFs and support-free ADFs under 3-valued semantics",
abstract = "Generalizing the attack structure in argumentation frameworks (AFs) has been studied in different ways. Most prominently, the binary attack relation of Dung frameworks has been extended to the notion of collective attacks. The resulting formalism is often termed SETAFs. Another approach is provided via abstract dialectical frameworks (ADFs), where acceptance conditions specify the relation between arguments; restricting these conditions naturally allows for so-called support-free ADFs. The aim of the paper is to shed light on the relation between these two different approaches. To this end, we investigate and compare the expressiveness of SETAFs and support-free ADFs under the lens of 3-valued semantics. Our results show that it is only the presence of unsatisfiable acceptance conditions in support-free ADFs that discriminate the two approaches.",
author = "W. Dvo{\v r}{\'a}k and A.K. Zafarghandi and S. Woltran",
note = "{\textcopyright} 2020 The authors and IOS Press; 8th International Conference on Computational Models of Argument, COMMA 2020 ; Conference date: 08-09-2020 Through 11-09-2020",
year = "2020",
doi = "10.3233/FAIA200504",
language = "English",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "191--202",
editor = "Henry Prakken and Stefano Bistarelli and Francesco Santini and Carlo Taticchi",
booktitle = "Computational Models of Argument - Proceedings of COMMA 2020",
}