{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:30Z","timestamp":1762101750565},"reference-count":30,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"unspecified","delay-in-days":64,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2015,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.<\/jats:p>","DOI":"10.1017\/s1471068415000149","type":"journal-article","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T08:21:21Z","timestamp":1441268481000},"page":"434-448","source":"Crossref","is-referenced-by-count":12,"title":["Improved answer-set programming encodings for abstract argumentation"],"prefix":"10.1017","volume":"15","author":[{"given":"SARAH A.","family":"GAGGL","sequence":"first","affiliation":[]},{"given":"NORBERT","family":"MANTHEY","sequence":"additional","affiliation":[]},{"given":"ALESSANDRO","family":"RONCA","sequence":"additional","affiliation":[]},{"given":"JOHANNES P.","family":"WALLNER","sequence":"additional","affiliation":[]},{"given":"STEFAN","family":"WOLTRAN","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"S1471068415000149_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"S1471068415000149_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20832-4_11"},{"key":"S1471068415000149_ref29","first-page":"1117","volume-title":"Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014)","author":"Vallati","year":"2014"},{"key":"S1471068415000149_ref27","unstructured":"Syrj\u00e4nen T. 2009. Logic programs and cardinality constraints: Theory and practice. Ph.D. thesis, Aalto University."},{"key":"S1471068415000149_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41524-1_7"},{"key":"S1471068415000149_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87803-2_14"},{"key":"S1471068415000149_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"S1471068415000149_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00261-8"},{"key":"S1471068415000149_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.001"},{"key":"S1471068415000149_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068415000149_ref22","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. , Lindauer M. , Ostrowski M. , Romero J. , Schaub T. and Thiele S. 2015. Potassco User Guide, Second edition ed."},{"key":"S1471068415000149_ref7","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exr033"},{"key":"S1471068415000149_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)80707-9"},{"key":"S1471068415000149_ref16","first-page":"72","volume-title":"Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR 2014)","author":"Dunne","year":"2014"},{"key":"S1471068415000149_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.008"},{"key":"S1471068415000149_ref25","first-page":"23","volume-title":"Proceedings of the 11th International Conference on Logic Programming (ICLP 1994)","author":"Lifschitz","year":"1994"},{"key":"S1471068415000149_ref21","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2010.486479"},{"key":"S1471068415000149_ref5","unstructured":"Caminada M. W. A. 2007. Comparing Two Unique Extension Semantics for Formal Argumentation: Ideal and Eager. In Proceedings of the 19th Belgian-Dutch Conference on Artificial Intelligence, BNAIC 2007. 81\u201387."},{"key":"S1471068415000149_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"S1471068415000149_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.003"},{"key":"S1471068415000149_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.96"},{"key":"S1471068415000149_ref9","first-page":"459","volume-title":"Proceedings of the 5th International Conference on Computational Models of Argument (COMMA 2014)","author":"Cerutti","year":"2014"},{"key":"S1471068415000149_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068415000149_ref30","unstructured":"Verheij B. 1996. Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages. In Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC'96), J.-J. C. Meyer and L. van der Gaag , Eds. 357\u2013368."},{"key":"S1471068415000149_ref8","first-page":"455","volume-title":"Proceedings of the 5th International Conference on Computational Models of Argument (COMMA 2014)","author":"Cerutti","year":"2014"},{"key":"S1471068415000149_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000329"},{"key":"S1471068415000149_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.005"},{"key":"S1471068415000149_ref2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262026437.001.0001"},{"key":"S1471068415000149_ref26","volume-title":"Argumentation in Artificial Intelligence","author":"Rahwan","year":"2009"},{"key":"S1471068415000149_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"}],"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\/S1471068415000149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T23:28:55Z","timestamp":1555802935000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068415000149\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":30,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["S1471068415000149"],"URL":"https:\/\/doi.org\/10.1017\/s1471068415000149","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}