Expressiveness of SETAFs and support-free ADFs under 3-valued semantics

W. Dvořák, A.K. Zafarghandi, S. Woltran

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationComputational Models of Argument - Proceedings of COMMA 2020
EditorsHenry Prakken, Stefano Bistarelli, Francesco Santini, Carlo Taticchi
PublisherIOS Press BV
Pages191-202
Number of pages12
ISBN (Electronic)9781643681061
DOIs
Publication statusPublished - 2020
Externally publishedYes
Event8th International Conference on Computational Models of Argument, COMMA 2020 - Virtual, Online, Italy
Duration: 8 Sept 202011 Sept 2020

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume326
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314

Conference

Conference8th International Conference on Computational Models of Argument, COMMA 2020
Country/TerritoryItaly
CityVirtual, Online
Period8/09/2011/09/20

Bibliographical note

© 2020 The authors and IOS Press

Funding

This research has been supported by FWF through projects I2854, P30168. The second researcher is currently embedded in the Center of Data Science & Systems Complexity (DSSC) Doctoral Programme, at the University of Groningen. Acknowledgments This research has been supported by FWF through projects I2854, P30168. The second researcher is currently embedded in the Center of Data Science & Systems Complexity (DSSC) Doctoral Programme, at the University of Groningen.

FundersFunder number
Rijksuniversiteit Groningen
Austrian Science FundI2854, P30168

    Fingerprint

    Dive into the research topics of 'Expressiveness of SETAFs and support-free ADFs under 3-valued semantics'. Together they form a unique fingerprint.

    Cite this