{"title":"Serialisable Semantics for Abstract Argumentation","authors":"Lars Bengel, Matthias Thimm","doi":"10.3233/FAIA220143","DOIUrl":null,"url":null,"abstract":". We investigate the recently proposed notion of serialisability of seman- tics for abstract argumentation frameworks. This notion describes semantics where the construction of extensions can be serialised through iterative addition of min- imal non-empty admissible sets. We investigate general relationships between serialisability and other principles from the literature. We also investigate the novel unchallenged semantics as a new instance of a serialisable semantics and, in particular, analyse it in terms of satisfied principles and computational complexity.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"93 1","pages":"80-91"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comma","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/FAIA220143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Arts and Humanities","Score":null,"Total":0}
引用次数: 2
Abstract
. We investigate the recently proposed notion of serialisability of seman- tics for abstract argumentation frameworks. This notion describes semantics where the construction of extensions can be serialised through iterative addition of min- imal non-empty admissible sets. We investigate general relationships between serialisability and other principles from the literature. We also investigate the novel unchallenged semantics as a new instance of a serialisable semantics and, in particular, analyse it in terms of satisfied principles and computational complexity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
