{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T14:44:59Z","timestamp":1663080299972},"reference-count":0,"publisher":"IOS Press","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,7]]},"abstract":"<jats:p>In this paper, we give an overview of several recent proposals for non-admissible non-naive semantics for abstract argumentation frameworks. We highlight the similarities and differences between weak admissibility-based approaches and undecidedness-blocking approaches using examples and principles as well as a study of their computational complexity. We introduce a kind of strengthened undecidedness-blocking semantics combining some of the distinctive behaviours of weak admissibility-based semantics with the lower complexity of undecidedness-blocking approaches. We call it loop semantics, because in our new semantics, an argument can only be undecided if it is part of a loop of undecided arguments. Our paper shows how a principle-based approach and a complexity-based approach can be used in tandem to further develop the foundations of formal argumentation.<\/jats:p>","DOI":"10.3233\/faia220147","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T14:21:50Z","timestamp":1663078910000},"source":"Crossref","is-referenced-by-count":0,"title":["Non-Admissibility in Abstract Argumentation"],"prefix":"10.3233","author":[{"given":"Wolfgang","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[{"name":"TU Wien"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tjitze","family":"Rienstra","sequence":"additional","affiliation":[{"name":"Maastricht University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leendert","family":"van der Torre","sequence":"additional","affiliation":[{"name":"University of Luxembourg"},{"name":"Zhejiang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[{"name":"TU Wien"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA220147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T14:21:51Z","timestamp":1663078911000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA220147"}},"subtitle":["New Loop Semantics, Overview, Complexity Analysis"],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia220147","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,7]]}}}