{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T15:58:10Z","timestamp":1765727890229,"version":"3.40.5"},"reference-count":57,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T00:00:00Z","timestamp":1579046400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments and the GRAPPA framework which allows argumentation scenarios to be represented as arbitrary edge-labeled graphs. The complexity of ADFs and GRAPPA is located beyond NP and ranges up to the third level of the polynomial hierarchy. The combined complexity of Answer Set Programming (ASP) exactly matches this complexity when programs are restricted to predicates of bounded arity. In this paper, we exploit this coincidence and present novel efficient translations from ADFs and GRAPPA to ASP. More specifically, we provide reductions for the five main ADF semantics of admissible, complete, preferred, grounded, and stable interpretations, and exemplify how these reductions need to be adapted for GRAPPA for the admissible, complete, and preferred semantics.<\/jats:p>","DOI":"10.1017\/s1471068419000474","type":"journal-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T10:05:23Z","timestamp":1579082723000},"page":"391-431","source":"Crossref","is-referenced-by-count":6,"title":["Solving Advanced Argumentation Problems with Answer Set Programming"],"prefix":"10.1017","volume":"20","author":[{"given":"GERHARD","family":"BREWKA","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6342-0756","authenticated-orcid":false,"given":"MARTIN","family":"DILLER","sequence":"additional","affiliation":[]},{"given":"GEORG","family":"HEISSENBERGER","sequence":"additional","affiliation":[]},{"given":"THOMAS","family":"LINSBICHLER","sequence":"additional","affiliation":[]},{"given":"STEFAN","family":"WOLTRAN","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"unstructured":"Ellmauthaler, S. and Strass, H. 2014. The DIAMOND system for computing with abstract dialectical frameworks. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 266. IOS Press, 233\u2013240.","key":"S1471068419000474_ref36"},{"unstructured":"Polberg, S. 2014. Extension-based semantics of abstract dialectical frameworks. In Proc. STAIRS. Frontiers in Artificial Intelligence and Applications, vol. 264. IOS Press, 240\u2013249.","key":"S1471068419000474_ref54"},{"key":"S1471068419000474_ref4","first-page":"1","article-title":"Argumentation in AI and Law: Editors\u2019 Introduction","volume":"1","author":"Bench-Capon","year":"2005","journal-title":"Artif. Intell. Law 13"},{"key":"S1471068419000474_ref44","first-page":"872","article-title":"Clingo goes linear constraints over reals and integers","volume":"5\u20136","author":"Janhunen","year":"2017","journal-title":"TPLP 17"},{"unstructured":"Gaggl, S. A. and Strass, H. 2014. Decomposing abstract dialectical frameworks. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 266. IOS Press, 281\u2013292.","key":"S1471068419000474_ref39"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref33","DOI":"10.1007\/BF01536399"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref12","DOI":"10.1145\/2043174.2043195"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref24","DOI":"10.1016\/j.artint.2014.11.008"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref48","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068419000474_ref7","first-page":"552","article-title":"The power of non-ground rules in answer set programming","volume":"5\u20136","author":"Bichler","year":"2016","journal-title":"TPLP 16"},{"unstructured":"Brewka, G. , Strass, H. , Ellmauthaler, S. , Wallner, J. P. and Woltran, S. 2013. Abstract Dialectical Frameworks Revisited. In Proc. IJCAI. IJCAI\/AAAI, 803\u2013809.","key":"S1471068419000474_ref16"},{"unstructured":"Bichler, M. , Morak, M. and Woltran, S. 2016a. lpopt: A rule optimization tool for answer set programming. In LOPSTR. Lecture Notes in Computer Science, vol. 10184. Springer, 114\u2013130.","key":"S1471068419000474_ref6"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref21","DOI":"10.1109\/MIS.2009.104"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref23","DOI":"10.1145\/800105.803397"},{"unstructured":"Brewka, G. and Woltran, S. 2010. Abstract Dialectical Frameworks. In Proc. KR. AAAI Press, 102\u2013111.","key":"S1471068419000474_ref18"},{"unstructured":"Lonsing, F. and Egly, U. 2017. Depqbf 6.0: A search-based QBF solver beyond traditional QCDCL. In Proc. CADE. Lecture Notes in Computer Science, vol. 10395. Springer, 371\u2013384.","key":"S1471068419000474_ref51"},{"key":"S1471068419000474_ref50","first-page":"71","article-title":"DepQBF: A Dependency-Aware QBF solver","volume":"2\u20133","author":"Lonsing","year":"2010","journal-title":"JSAT 7"},{"unstructured":"Brewka, G. , Strass, H. , Wallner, J. P. and Woltran, S. 2018. Weighted abstract dialectical frameworks. In Proc. AAAI. AAAI Press, 1779\u20131786.","key":"S1471068419000474_ref17"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref38","DOI":"10.1609\/aimag.v39i4.2781"},{"unstructured":"Lehtonen, T. , Wallner, J. P. and J\u00e4rvisalo, M. 2017. Assumption-Based Argumentation Translated to Argumentation Frameworks. URL: http:\/\/argumentationcompetition.org\/2017\/ABA2AF.pdf","key":"S1471068419000474_ref47"},{"unstructured":"Strass, H. and Ellmauthaler, S. 2017. goDIAMOND 0.6.6 \u2013 ICCMA 2017 System Description. URL: http:\/\/argumentationcompetition.org\/2017\/goDIAMOND.pdf.","key":"S1471068419000474_ref56"},{"unstructured":"Atkinson, K. and Bench-Capon, T. J. M. 2018. Relating the ANGELIC methodology and ASPIC+. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 305. IOS Press, 109\u2013116.","key":"S1471068419000474_ref3"},{"key":"S1471068419000474_ref13","first-page":"236","volume-title":"Handbook of Formal Argumentation","author":"Brewka","year":"2018"},{"unstructured":"Redl, C. 2017. Answer set programs with queries over subprograms. In Proc. LPNMR. Lecture Notes in Computer Science, vol. 10377. Springer, 160\u2013175.","key":"S1471068419000474_ref55"},{"unstructured":"Brewka, G. , P\u00fchrer, J. and Woltran, S. 2019. Multi-valued GRAPPA. In Proc. JELIA. Lecture Notes in Computer Science, vol. 11468. Springer, 85\u2013101.","key":"S1471068419000474_ref15"},{"unstructured":"Brewka, G. and Woltran, S. 2014. GRAPPA: A semantical framework for graph-based argument processing. In Proc. ECAI. Frontiers in Artificial Intelligence and Applications, vol. 263. IOS Press, 153\u2013158.","key":"S1471068419000474_ref19"},{"unstructured":"Diller, M. , Wallner, J. P. and Woltran, S. 2014. Reasoning in abstract dialectical frameworks using quantified boolean formulas. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 266. IOS Press, 241\u2013252.","key":"S1471068419000474_ref28"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref45","DOI":"10.1609\/aimag.v37i3.2671"},{"key":"S1471068419000474_ref9","first-page":"570","article-title":"Stable-unstable semantics: Beyond NP with normal logic programs","volume":"5\u20136","author":"Bogaerts","year":"2016","journal-title":"TPLP 16"},{"unstructured":"E\u00e9n, N. and S\u00f6rensson, N. 2003. An extensible SAT-solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Giunchiglia, E. and Tacchella, A. , Eds. Lecture Notes in Computer Science, vol. 2919. Springer, 502\u2013518.","key":"S1471068419000474_ref31"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref32","DOI":"10.1007\/s10472-008-9086-5"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref30","DOI":"10.1016\/0004-3702(94)00041-X"},{"unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Lindauer, M. , Ostrowski, M. , Romero, J. , Schaub, T. and Thiele, S. 2015. Potassco User Guide. URL: https:\/\/sourceforge.net\/projects\/potassco\/files\/guide\/. [Accessed on November 22, 2016].","key":"S1471068419000474_ref40"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref34","DOI":"10.1145\/261124.261126"},{"key":"S1471068419000474_ref1","first-page":"1","article-title":"A methodology for designing systems to reason with legal cases using abstract dialectical frameworks","volume":"1","author":"Al-Abdulkarim","year":"2016","journal-title":"Artif. Intell. Law 24"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref2","DOI":"10.1016\/j.artint.2008.11.006"},{"unstructured":"Linsbichler, T. , Maratea, M. , Niskanen, A. , Wallner, J. P. and Woltran, S. 2018. Novel algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. In Proc. IJCAI. ijcai.org, 1905\u20131911.","key":"S1471068419000474_ref49"},{"unstructured":"McBurney, P. , Parsons, S. and Rahwan, I. , Eds. 2012. Proc. ArgMAS. Lecture Notes in Computer Science, vol. 7543. Springer.","key":"S1471068419000474_ref52"},{"unstructured":"Cabrio, E. and Villata, S. 2016. Abstract dialectical frameworks for text exploration. In Proc. ICAART\u201916. SciTePress, 85\u201395.","key":"S1471068419000474_ref20"},{"unstructured":"Keshavarzi Zafarghandi, A. 2017. Investigating Subclasses of Abstract Dialectical Frameworks. M.S. thesis, Vienna University of Technology, Institute of Information Systems.","key":"S1471068419000474_ref46"},{"unstructured":"Cerutti, F. , Giacomin, M. and Vallati, M. 2017. Exploiting Planning Problems for Generating Challenging Abstract Argumentation Frameworks. URL: http:\/\/argumentationcompetition.org\/2017\/Planning2AF.pdf","key":"S1471068419000474_ref22"},{"key":"S1471068419000474_ref10","first-page":"296","volume-title":"Advances in KR, Logic Programming, and Abstract Argumentation","author":"Booth","year":"2015"},{"unstructured":"Ellmauthaler, S. and Strass, H. 2016. DIAMOND 3.0 \u2013 A native C++ implementation of DIAMOND. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 287. IOS Press, 471\u2013472.","key":"S1471068419000474_ref37"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref57","DOI":"10.1016\/j.artint.2015.05.003"},{"unstructured":"Berthold, M. 2016. Extending the DIAMOND system to work with GRAPPA. In Proc. SAFA, 52\u201362.","key":"S1471068419000474_ref5"},{"unstructured":"Diller, M. 2019. Realising argumentation using answer set programming and quantified boolean formulas. Ph.D. thesis, TU Wien.","key":"S1471068419000474_ref26"},{"unstructured":"Brewka, G. , Diller, M. , Heissenberger, G. , Linsbichler, T. and Woltran, S. 2017. Solving advanced argumentation problems with answer-set programming. In Proc. AAAI. AAAI Press, 1077\u20131083.","key":"S1471068419000474_ref11"},{"unstructured":"Diller, M. 2017. Traffic Networks Become Argumentation Frameworks. URL: http:\/\/argumentationcompetition.org\/2017\/Traffic.pdf","key":"S1471068419000474_ref25"},{"unstructured":"Bichler, M. , Morak, M. and Woltran, S. 2018. Single-shot epistemic logic program solving. In Proc. IJCAI. ijcai.org, 1714\u20131720.","key":"S1471068419000474_ref8"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref42","DOI":"10.1007\/BF03037169"},{"key":"S1471068419000474_ref41","first-page":"181","article-title":"The potsdam answer set solving collection 5.0","volume":"32","author":"Gebser","year":"2018","journal-title":"KI"},{"unstructured":"Diller, M. , Keshavarzi Zafarghandi, A. , Linsbichler, T. and Woltran, S. 2018. Investigating subclasses of abstract dialectical frameworks. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 305. IOS Press, 61\u201372.","key":"S1471068419000474_ref27"},{"key":"S1471068419000474_ref14","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MIS.2013.122","article-title":"Generalizations of dung frameworks and their role in formal argumentation","volume":"1","author":"Brewka","year":"2014","journal-title":"IEEE Intell. Syst. 29"},{"unstructured":"Neugebauer, D. 2018. DABASCO: Generating AF, ADF, and ASPIC+ instances from real-world discussions. In Proc. COMMA. Frontiers in Artificial Intelligence and Applications, vol. 305. IOS Press, 469\u2013470.","key":"S1471068419000474_ref53"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref29","DOI":"10.1080\/19462166.2015.1036922"},{"doi-asserted-by":"publisher","key":"S1471068419000474_ref43","DOI":"10.1613\/jair.4694"},{"unstructured":"Ellmauthaler, S. 2012. Abstract Dialectical Frameworks: Properties, Complexity, and Implementation. M.S. thesis, TU Wien.","key":"S1471068419000474_ref35"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068419000474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T04:08:44Z","timestamp":1695614924000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000474\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,15]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["S1471068419000474"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000474","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2020,1,15]]}}}