{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:47:51Z","timestamp":1777434471178,"version":"3.51.4"},"reference-count":53,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T00:00:00Z","timestamp":1514937600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Argument &amp; Computation"],"published-print":{"date-parts":[[2018,1,31]]},"abstract":"<jats:p>Abstract solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way via graphs. Compared to traditional methods like pseudo-code descriptions, abstract solvers have several advantages. In particular, they provide a uniform formal representation that allows for precise comparisons of different algorithms. Recently, this new methodology has proven successful in declarative paradigms such as Propositional Satisfiability and Answer Set Programming. In this paper, we apply this machinery to Dung\u2019s abstract argumentation frameworks. We first provide descriptions of several advanced algorithms for the preferred semantics in terms of abstract solvers. We also show how it is possible to obtain new abstract solutions by \u201ccombining\u201d concepts of existing algorithms by means of combining abstract solvers. Then, we implemented a new solving procedure based on our findings in cegartix, and call it cegartix+. We finally show that cegartix+ is competitive and complementary in its performance to cegartix on benchmarks of the first and second argumentation competition.<\/jats:p>","DOI":"10.3233\/aac-170031","type":"journal-article","created":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T11:04:20Z","timestamp":1515409460000},"page":"41-72","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Abstract solvers for Dung\u2019s argumentation frameworks"],"prefix":"10.1177","volume":"9","author":[{"given":"Remi","family":"Brochenin","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica, Bioingegneria, Robotica e Ingegneria dei Sistemi, Universit\u00e0 di Genova, Italy. E-mails:\u00a0,\u00a0"}]},{"given":"Thomas","family":"Linsbichler","sequence":"additional","affiliation":[{"name":"Institute of Information Systems, TU Wien, Austria. E-mails:\u00a0,\u00a0,\u00a0"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Bioingegneria, Robotica e Ingegneria dei Sistemi, Universit\u00e0 di Genova, Italy. E-mails:\u00a0,\u00a0"}]},{"given":"Johannes P.","family":"Wallner","sequence":"additional","affiliation":[{"name":"Institute of Information Systems, TU Wien, Austria. E-mails:\u00a0,\u00a0,\u00a0"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[{"name":"Institute of Information Systems, TU Wien, Austria. E-mails:\u00a0,\u00a0,\u00a0"}]}],"member":"179","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"ref002","doi-asserted-by":"crossref","unstructured":"R.\u00a0Baumann, Splitting an argumentation framework, in: Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2011, J.P.\u00a0Delgrande and W.\u00a0Faber, eds, Lecture Notes in Computer Science, Vol.\u00a06645, Springer, 2011, pp.\u00a040\u201353.","DOI":"10.1007\/978-3-642-20895-9_6"},{"key":"ref003","doi-asserted-by":"crossref","unstructured":"R.\u00a0Baumann and C.\u00a0Spanring, Infinite argumentation frameworks \u2013 On the existence and uniqueness of extensions, in: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation \u2013 Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, T.\u00a0Eiter, H.\u00a0Strass, M.\u00a0Truszczynski and S.\u00a0Woltran, eds, Lecture Notes in Computer Science, Vol.\u00a09060, Springer, 2015, pp.\u00a0281\u2013295.","DOI":"10.1007\/978-3-319-14726-0_19"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.001"},{"key":"ref005","unstructured":"P.\u00a0Besnard and S.\u00a0Doutre, Checking the acceptability of a set of arguments, in: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning, NMR 2004, J.P.\u00a0Delgrande and T.\u00a0Schaub, eds, 2004, pp.\u00a059\u201364."},{"key":"ref006","doi-asserted-by":"crossref","unstructured":"R.\u00a0Brochenin, Y.\u00a0Lierler and M.\u00a0Maratea, Abstract disjunctive answer set solvers, in: Proceedings of the 21st European Conference on Artificial Intelligence, ECAI 2014, T.\u00a0Schaub, G.\u00a0Friedrich and B.\u00a0O\u2019Sullivan, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0263, IOS Press, 2014, pp.\u00a0165\u2013170.","DOI":"10.3233\/978-1-61499-419-0-165"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000411"},{"key":"ref008","doi-asserted-by":"crossref","unstructured":"R.\u00a0Brochenin, T.\u00a0Linsbichler, M.\u00a0Maratea, J.P.\u00a0Wallner and S.\u00a0Woltran, Abstract solvers for Dung\u2019s argumentation frameworks, in: Proceedings of the 3rd International Workshop on Theory and Applications of Formal Argumentation, TAFA 2015, Revised Selected Papers, E.\u00a0Black, S.\u00a0Modgil and N.\u00a0Oren, eds, Lecture Notes in Computer Science, Vol.\u00a09524, Springer, 2015, pp.\u00a040\u201358.","DOI":"10.1007\/978-3-319-28460-6_3"},{"key":"ref009","doi-asserted-by":"crossref","unstructured":"R.\u00a0Brochenin and M.\u00a0Maratea, Abstract solvers for quantified Boolean formulas and their applications, in: Proceedings of the 14th International Conference of the Italian Association for Artificial Intelligence, AI*IA 2015, M.\u00a0Gavanelli, E.\u00a0Lamma and F.\u00a0Riguzzi, eds, Lecture Notes in Computer Science, Vol.\u00a09336, Springer, 2015, pp.\u00a0205\u2013217.","DOI":"10.1007\/978-3-319-24309-2_16"},{"key":"ref010","unstructured":"R.\u00a0Brochenin and M.\u00a0Maratea, Abstract answer set solvers for cautious reasoning, in: Proceedings of the Technical Communications of the 31st International Conference on Logic Programming, ICLP 2015, M.D.\u00a0Vos, T.\u00a0Eiter, Y.\u00a0Lierler and F.\u00a0Toni, eds, CEUR Workshop Proceedings, Vol.\u00a01433, CEUR-WS.org, 2015."},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exr033"},{"key":"ref012","unstructured":"T.\u00a0Castell, C.\u00a0Cayrol, M.\u00a0Cayrol and D.L.\u00a0Berre, Using the Davis and Putnam procedure for an efficient computation of preferred models, in: Proceedings of the 12th European Conference on Artificial Intelligence, ECAI 1996, W.\u00a0Wahlster, ed. Wiley, Chichester, 1996, pp.\u00a0350\u2013354."},{"key":"ref013","doi-asserted-by":"crossref","unstructured":"F.\u00a0Cerutti, P.E.\u00a0Dunne, M.\u00a0Giacomin and M.\u00a0Vallati, Computing preferred extensions in abstract argumentation: A\u00a0SAT-based approach, in: Proceedings of the 2nd International Workshop on Theory and Applications of Formal Argumentation, TAFA 2013, Revised Selected Papers, E.\u00a0Black, S.\u00a0Modgil and N.\u00a0Oren, eds, Lecture Notes in Computer Science, Vol.\u00a08306, Springer, 2014, pp.\u00a0176\u2013193.","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"ref014","unstructured":"F.\u00a0Cerutti, M.\u00a0Giacomin and M.\u00a0Vallati, ArgSemSAT: Solving argumentation problems using SAT, in: Proceedings of the 5th International Conference on Computational Models of Argument, COMMA 2014, S.\u00a0Parsons, N.\u00a0Oren, C.\u00a0Reed and F.\u00a0Cerutti, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0266, IOS Press, 2014, pp.\u00a0455\u2013456."},{"key":"ref015","unstructured":"F.\u00a0Cerutti, M.\u00a0Giacomin and M.\u00a0Vallati, Algorithm selection for preferred extensions enumeration, in: Proceedings of the 5th International Conference on Computational Models of Argument, COMMA 2014, S.\u00a0Parsons, N.\u00a0Oren, C.\u00a0Reed and F.\u00a0Cerutti, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0266, IOS Press, 2014, pp.\u00a0221\u2013232."},{"key":"ref016","unstructured":"F.\u00a0Cerutti, M.\u00a0Giacomin, M.\u00a0Vallati and M.\u00a0Zanella, An SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation, in: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning, KR 2014, C.\u00a0Baral, G.D.\u00a0Giacomo and T.\u00a0Eiter, eds, AAAI Press, 2014, pp.\u00a042\u201351."},{"key":"ref017","unstructured":"F.\u00a0Cerutti, N.\u00a0Oren, H.\u00a0Strass, M.\u00a0Thimm and M.\u00a0Vallati, A benchmark framework for a computational argumentation competition, in: Proceedings of the 5th International Conference on Computational Models of Argument, COMMA 2014, S.\u00a0Parsons, N.\u00a0Oren, C.\u00a0Reed and F.\u00a0Cerutti, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0266, IOS Press, 2014, pp.\u00a0459\u2013460."},{"key":"ref018","unstructured":"F.\u00a0Cerutti, M.\u00a0Vallati and M.\u00a0Giacomin, Where are we now? State of the art and future trends of solvers for hard argumentation problems, in: Computational Models of Argument \u2013 Proceedings of COMMA 2016, P.\u00a0Baroni, T.F.\u00a0Gordon, T.\u00a0Scheffler and M.\u00a0Stede, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0287, IOS Press, 2016, pp.\u00a0207\u2013218."},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.008"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)80707-9"},{"key":"ref022","doi-asserted-by":"crossref","unstructured":"S.\u00a0Doutre and J.\u00a0Mengin, Preferred extensions of argumentation frameworks: Query answering and computation, in: Proceedings of the 1st International Joint Conference on Automated Reasoning, IJCAR 2001, R.\u00a0Gor\u00e9, A.\u00a0Leitsch and T.\u00a0Nipkow, eds, Lecture Notes in Computer Science, Vol.\u00a02083, Springer, 2001, pp.\u00a0272\u2013288.","DOI":"10.1007\/3-540-45744-5_20"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00261-8"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.001"},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.005"},{"key":"ref027","unstructured":"S.A.\u00a0Gaggl, T.\u00a0Linsbichler, M.\u00a0Maratea and S.\u00a0Woltran, Introducing the second international competition on computational models of argumentation, in: Proceedings of the 1st International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2016), M.\u00a0Thimm, F.\u00a0Cerutti, H.\u00a0Strass and M.\u00a0Vallati, eds, 2016, pp.\u00a04\u20139. https:\/\/www.dbai.tuwien.ac.at\/iccma17\/Introducing_ICCMA17.pdf."},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000149"},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"ref030","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9062-z"},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2008.02.005"},{"key":"ref032","doi-asserted-by":"crossref","unstructured":"J.\u00a0Lagniez, E.\u00a0Lonca and J.\u00a0Mailly, CoQuiAAS: A constraint-based quick abstract argumentation solver, in: Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2015, IEEE Computer Society, 2015, pp.\u00a0928\u2013935.","DOI":"10.1109\/ICTAI.2015.134"},{"key":"ref033","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9364-8"},{"key":"ref034","unstructured":"B.\u00a0Liao, Efficient Computation of Argumentation Semantics, Intelligent Systems Series, Academic Press, 2014. ISBN 978-0-12-410406-8. http:\/\/store.elsevier.com\/product.jsp?isbn=9780124104068."},{"key":"ref035","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lierler, Abstract answer set solvers, in: Proceedings of the 24th International Conference on Logic Programming, ICLP 2008, M.G.\u00a0de\u00a0la Banda and E.\u00a0Pontelli, eds, Lecture Notes in Computer Science, Vol.\u00a05366, Springer, 2008, pp.\u00a0377\u2013391.","DOI":"10.1007\/978-3-540-89982-2_35"},{"key":"ref036","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000578"},{"key":"ref037","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.004"},{"key":"ref038","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000214"},{"key":"ref039","unstructured":"Y.\u00a0Lierler and M.\u00a0Truszczynski, Modular answer set solving, in: Late-Breaking Developments in the Field of Artificial Intelligence, AAAI Workshops, Vol.\u00a0WS-13-17, AAAI, 2013."},{"key":"ref040","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lierler and M.\u00a0Truszczynski, Abstract modular inference systems and solvers, in: Proceedings of the 16th International Symposium on Practical Aspects of Declarative Languages, PADL 2014, M.\u00a0Flatt and H.\u00a0Guo, eds, Lecture Notes in Computer Science, Vol.\u00a08324, Springer, 2014, pp.\u00a049\u201364.","DOI":"10.1007\/978-3-319-04132-2_4"},{"key":"ref041","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lierler and M.\u00a0Truszczynski, An abstract view on modularity in knowledge representation, in: Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015, B.\u00a0Bonet and S.\u00a0Koenig, eds, AAAI Press, 2015, pp.\u00a01532\u20131538.","DOI":"10.1609\/aaai.v29i1.9390"},{"key":"ref042","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.004"},{"key":"ref043","doi-asserted-by":"crossref","unstructured":"S.\u00a0Modgil and M.W.A.\u00a0Caminada, Proof theories and algorithms for abstract argumentation frameworks, in: Argumentation in Artificial Intelligence, I.\u00a0Rahwan and G.R.\u00a0Simari, eds, Springer, 2009, pp.\u00a0105\u2013129.","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"ref044","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"ref045","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.11.001"},{"key":"ref046","doi-asserted-by":"crossref","unstructured":"I.\u00a0Rahwan and G.R.\u00a0Simari (eds), Argumentation in Artificial Intelligence, Springer, 2009. doi:10.1007\/978-0-387-98197-0.","DOI":"10.1007\/978-0-387-98197-0"},{"key":"ref047","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9095-y"},{"key":"ref048","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190034"},{"key":"ref049","unstructured":"M.\u00a0Thimm and S.\u00a0Villata, System descriptions of the first International competition on computational models of argumentation (ICCMA\u201915), 2015. arXiv:1510.05373."},{"key":"ref050","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.08.006"},{"key":"ref051","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i1.2640"},{"key":"ref052","unstructured":"B.\u00a0Verheij, Two approaches to dialectical argumentation: Admissible sets and argumentation stages, in: Proceedings of the 8th Dutch Conference on Artificial Intelligence, NAIC 1996, J.J.C.\u00a0Meyer and L.C.\u00a0van der Gaag, eds, 1996, pp.\u00a0357\u2013368."},{"key":"ref053","doi-asserted-by":"crossref","unstructured":"J.P.\u00a0Wallner, G.\u00a0Weissenbacher and S.\u00a0Woltran, Advanced SAT techniques for abstract argumentation, in: Proceedings of the 14th International Workshop on Computational Logic in Multi-Agent Systems, CLIMA 2013, J.\u00a0Leite, T.C.\u00a0Son, P.\u00a0Torroni, L.\u00a0van\u00a0der Torre and S.\u00a0Woltran, eds, Lecture Notes in Computer Science, Vol.\u00a08143, Springer, 2013, pp.\u00a0138\u2013154.","DOI":"10.1007\/978-3-642-40624-9_9"}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-170031","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-170031","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-170031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:51Z","timestamp":1777377231000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-170031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,3]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1,31]]}},"alternative-id":["10.3233\/AAC-170031"],"URL":"https:\/\/doi.org\/10.3233\/aac-170031","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,3]]}}}