{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T13:10:40Z","timestamp":1740057040706,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>We introduce a decomposition scheme for abstract dialectical frameworks (ADFs). The decomposition proceeds along the ADF's strongly connected components. For several semantics, the decomposition-based version coincides with the original semantics. For others, the scheme defines new semantics. These new semantics allow us to deal with pertinent problems such as odd-length negative cycles in a more general setting, that for instance also encompasses logic programs.<\/jats:p>","DOI":"10.3233\/978-1-61499-436-7-281","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:06:08Z","timestamp":1740053168000},"source":"Crossref","is-referenced-by-count":0,"title":["Decomposing Abstract Dialectical Frameworks"],"prefix":"10.3233","author":[{"family":"Gaggl Sarah Alice","sequence":"additional","affiliation":[]},{"family":"Strass Hannes","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:54:36Z","timestamp":1740056076000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=266&spage=281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-436-7-281","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}