{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:28:02Z","timestamp":1740461282539,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"abstract":"<jats:p>Abstract dialectical frameworks (ADFs) are generalizations of Dung argumentation frameworks where arbitrary relationships among arguments can be formalized. This additional expressibility comes with the price of higher computational complexity, thus an understanding of potentially easier subclasses is essential. Compared to Dung argumentation frameworks, where several subclasses such as acyclic and symmetric frameworks are well understood, there has been no indepth analysis for ADFs in such direction yet (with the notable exception of bipolar ADFs). In this work, we introduce certain subclasses of ADFs and investigate their properties. In particular, we show that for acyclic ADFs, the different semantics coincide. On the other hand, we show that the concept of symmetry is less powerful for ADFs and further restrictions are required to achieve results that are similar to the known ones for Dung's frameworks. We also provide experiments to analyse the performance of solvers when applied to particular subclasses of ADFs.<\/jats:p>","DOI":"10.3233\/978-1-61499-906-5-61","type":"book-chapter","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T11:59:50Z","timestamp":1740398390000},"source":"Crossref","is-referenced-by-count":0,"title":["Investigating Subclasses of Abstract Dialectical Frameworks"],"prefix":"10.3233","author":[{"family":"Diller Martin","sequence":"additional","affiliation":[]},{"family":"Keshavarzi Zafarghandi Atefeh","sequence":"additional","affiliation":[]},{"family":"Linsbichler Thomas","sequence":"additional","affiliation":[]},{"family":"Woltran Stefan","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T12:21:04Z","timestamp":1740399664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISBN&isbn=978-1-61499-905-8&spage=61&doi=10.3233\/978-1-61499-906-5-61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-906-5-61","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2018]]}}}