{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:14:54Z","timestamp":1748751294803,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319284590"},{"type":"electronic","value":"9783319284606"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28460-6_3","type":"book-chapter","created":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T07:23:09Z","timestamp":1452064989000},"page":"40-58","source":"Crossref","is-referenced-by-count":3,"title":["Abstract Solvers for Dung\u2019s Argumentation Frameworks"],"prefix":"10.1007","author":[{"given":"Remi","family":"Brochenin","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Linsbichler","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Johannes Peter","family":"Wallner","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,7]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0269888911000166","volume":"26","author":"P Baroni","year":"2011","unstructured":"Baroni, P., Caminada, M.W.A., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365\u2013410 (2011)","journal-title":"Knowl. Eng. Rev."},{"issue":"10\u201315","key":"3_CR2","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2007.05.001","volume":"171","author":"TJM Bench-Capon","year":"2007","unstructured":"Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artif. Intell. 171(10\u201315), 619\u2013641 (2007)","journal-title":"Artif. Intell."},{"key":"3_CR3","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Delgrande, J.P., Schaub, T. (eds.) Proceedings of the 10th International Workshop on Non-Monotonic Reasoning, NMR 2004, pp. 59\u201364 (2004)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Brochenin, R., Lierler, Y., Maratea, M.: Abstract disjunctive answer set solvers. In: Schaub, T., Friedrich, G., O\u2019Sullivan, B. (eds.) Proceedings of the 21st European Conference on Artificial Intelligence, ECAI 2014. FAIA, vol. 263, pp. 165\u2013170. IOS Press (2014)","DOI":"10.3233\/978-1-61499-419-0-165"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-642-54373-9_12","volume-title":"Theory and Applications of FormalArgumentation","author":"F Cerutti","year":"2014","unstructured":"Cerutti, F., Dunne, P.E., Giacomin, M., Vallati, M.: Computing preferred extensions in abstract argumentation: a SAT-based approach. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2013. LNCS, vol. 8306, pp. 176\u2013193. Springer, Heidelberg (2014)"},{"key":"3_CR6","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: ArgSemSAT: Solving argumentation problems using SAT. In: Parsons, S., Oren, N., Reed, C., Cerutti, F. (eds.) Proceedings of the 5th International Conference on Computational Models of Argument, COMMA 2014. FAIA, vol. 266, pp. 455\u2013456. IOS Press (2014)"},{"key":"3_CR7","unstructured":"Cerutti, F., Oren, N., Strass, H., Thimm, M., Vallati, M.: A benchmark framework for a computational argumentation competition. In: Parsons, S., Oren, N., Reed, C., Cerutti, F. (eds.) Proceedings of the 5th International Conference on Computational Models of Argument, COMMA 2014. FAIA, vol. 266, pp. 459\u2013460. IOS Press (2014)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.artint.2014.11.008","volume":"220","author":"G Charwat","year":"2015","unstructured":"Charwat, G., Dvo\u0159\u00e1k, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation - a survey. Artif. Intell. 220, 28\u201363 (2015)","journal-title":"Artif. Intell."},{"issue":"7","key":"3_CR9","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"3_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","volume":"170","author":"Y Dimopoulos","year":"1996","unstructured":"Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci. 170(1\u20132), 209\u2013244 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45744-5_20","volume-title":"Automated Reasoning","author":"S Doutre","year":"2001","unstructured":"Doutre, S., Mengin, J.: Preferred extensions of argumentation frameworks: query answering and computation. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 272\u2013288. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"1\/2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","volume":"141","author":"PE Dunne","year":"2002","unstructured":"Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artif. Intell. 141(1\/2), 187\u2013203 (2002)","journal-title":"Artif. Intell."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.artint.2013.10.001","volume":"206","author":"W Dvo\u0159\u00e1k","year":"2014","unstructured":"Dvo\u0159\u00e1k, W., J\u00e4rvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53\u201378 (2014)","journal-title":"Artif. Intell."},{"issue":"11","key":"3_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.ipl.2010.04.005","volume":"110","author":"W Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k, W., Woltran, S.: Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11), 425\u2013430 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"3_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1017\/S1471068410000578","volume":"11","author":"Y Lierler","year":"2011","unstructured":"Lierler, Y.: Abstract answer set solvers with backjumping and learning. Theory Pract. Log. Program. 11(2\u20133), 135\u2013169 (2011)","journal-title":"Theory Pract. Log. Program."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.10.004","volume":"207","author":"Y Lierler","year":"2014","unstructured":"Lierler, Y.: Relating constraint answer set programming languages and algorithms. Artif. Intell. 207, 1\u201322 (2014)","journal-title":"Artif. Intell."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-0-387-98197-0_6","volume-title":"Argumentation in Artificial Intelligence","author":"S Modgil","year":"2009","unstructured":"Modgil, S., Caminada, M.W.A.: Proof theories and algorithms for abstract argumentation frameworks. In: Rahwan, I., Simari, G.R. (eds.) Argumentation in Artificial Intelligence, pp. 105\u2013129. Springer, Heidelberg (2009)"},{"issue":"6","key":"3_CR19","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.artint.2013.11.001","volume":"207","author":"S Nofal","year":"2014","unstructured":"Nofal, S., Atkinson, K., Dunne, P.E.: Algorithms for decision problems in argument systems under preferred semantics. Artif. Intell. 207, 23\u201351 (2014)","journal-title":"Artif. Intell."},{"volume-title":"Argumentation in Artificial Intelligence","year":"2009","key":"3_CR21","unstructured":"Rahwan, I., Simari, G.R. (eds.): Argumentation in Artificial Intelligence. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Formal Argumentation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28460-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T01:58:07Z","timestamp":1748743087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28460-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319284590","9783319284606"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28460-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}