{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,16]],"date-time":"2026-11-16T18:09:33Z","timestamp":1794852573244,"version":"4.9.1"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643686806","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T00:00:00Z","timestamp":1788998400000},"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":[[2026,9,10]]},"abstract":"<jats:p>Translating logic programs (LPs) into argumentation frameworks (AFs) can help explain program conclusions by encoding rule interactions as a graph of arguments and attacks. While the standard instantiated argumentation (IA) approach achieves correct semantic equivalences between many LP and AF semantics, it constructs arguments by recursively nesting sub-arguments, hiding positive body dependencies inside arguments rather than in the attack graph. We formalize this problem using different levels of explanation faithfulness and propose an alternative AF encoding that represents the natural AND\/OR derivation structure of programs. The resulting instantiation is a standard Dung AF, linear in the size of the LP (and in general PTIME to construct). We show the grounded labeling of the AF matches the well-founded model and that the encoding is explanation faithful.<\/jats:p>","DOI":"10.3233\/faia260797","type":"book-chapter","created":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T21:07:34Z","timestamp":1789074454000},"source":"Crossref","is-referenced-by-count":0,"title":["Lost in Translation: Towards Explainable Instantiated Argumentation Frameworks"],"prefix":"10.3233","author":[{"given":"Shawn","family":"Bowers","sequence":"first","affiliation":[{"name":"Department of Computer Science, Gonzaga University, Spokane, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertram","family":"Lud\u00e4scher","sequence":"additional","affiliation":[{"name":"School of Information Sciences, University of Illinois Urbana-Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"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\/FAIA260797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T21:07:35Z","timestamp":1789074455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA260797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,10]]},"ISBN":["9781643686806"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia260797","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,10]]}}}