{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:38:39Z","timestamp":1762101519359},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642543722"},{"type":"electronic","value":"9783642543739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54373-9_12","type":"book-chapter","created":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T21:39:17Z","timestamp":1391377157000},"page":"176-193","source":"Crossref","is-referenced-by-count":26,"title":["Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach"],"prefix":"10.1007","author":[{"given":"Federico","family":"Cerutti","sequence":"first","affiliation":[]},{"given":"Paul E.","family":"Dunne","sequence":"additional","affiliation":[]},{"given":"Massimiliano","family":"Giacomin","sequence":"additional","affiliation":[]},{"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Amgoud, L., Devred, C.: Argumentation frameworks as constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence, 1\u201318 (2013)","DOI":"10.1007\/s10472-013-9343-0"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C. Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT. Artificial Intelligence\u00a0196, 77\u2013105 (2013)","journal-title":"Artificial Intelligence"},{"key":"12_CR3","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of IJCAI 2009, pp. 399\u2013404 (2009)"},{"key":"12_CR4","unstructured":"Audemard, G., Simon, L.: Glucose 2.1 (2012), \n                  \n                    http:\/\/www.lri.fr\/~simon\/?page=glucose"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0269888911000166","volume":"26","author":"P. Baroni","year":"2011","unstructured":"Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Engineering Review\u00a026(4), 365\u2013410 (2011)","journal-title":"Knowledge Engineering Review"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Baroni, P., Giacomin, M.: Semantics of abstract argumentation systems. In: Argumentation in Artificial Intelligence, pp. 25\u201344. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0_2"},{"issue":"1-2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.05.006","volume":"168","author":"P. Baroni","year":"2005","unstructured":"Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artificial Intelligence\u00a0168(1-2), 165\u2013210 (2005)","journal-title":"Artificial Intelligence"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.artint.2013.05.002","volume":"203","author":"P. Baroni","year":"2013","unstructured":"Baroni, P., Cerutti, F., Dunne, P.E., Giacomin, M.: Automata for infinite argumentation structures. Artificial Intelligence\u00a0203, 104\u2013150 (2013)","journal-title":"Artificial Intelligence"},{"key":"12_CR9","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Proceedings of NMR 2004, pp. 59\u201364 (2004)"},{"key":"12_CR10","unstructured":"Biere, A.: P{re,ic}oSAT@sc 2009. In: SAT Competition (2009)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Santini, F.: Modeling and solving AFs with a constraint-based tool: Conarg. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol.\u00a07132, pp. 99\u2013116. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29184-5_7"},{"key":"12_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11853886_11","volume-title":"Logics in Artificial Intelligence","author":"M. Caminada","year":"2006","unstructured":"Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol.\u00a04160, pp. 111\u2013123. Springer, Heidelberg (2006)"},{"key":"12_CR13","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of COMMA 2006, pp. 121\u2013130 (2006)"},{"issue":"2-3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11225-009-9218-x","volume":"93","author":"M. Caminada","year":"2009","unstructured":"Caminada, M., Gabbay, D.M.: A logical account of formal argumentation. Studia Logica (Special Issue: New Ideas in Argumentation Theory)\u00a093(2-3), 109\u2013145 (2009)","journal-title":"Studia Logica (Special Issue: New Ideas in Argumentation Theory)"},{"key":"12_CR15","unstructured":"Cerutti, F., Dunne, P.E., Giacomin, M., Vallati, M.: Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach. Tech. rep. (2013), \n                  \n                    http:\/\/arxiv.org\/abs\/1310.4986"},{"key":"12_CR16","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Preferred arguments are harder to compute than stable extensions. In: Proceedings of IJCAI 1999, pp. 36\u201343 (1999)"},{"key":"12_CR17","doi-asserted-by":"crossref","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. Journal Theoretical Computer Science\u00a0170, 209\u2013244 (1996)","journal-title":"Journal Theoretical Computer Science"},{"key":"12_CR18","series-title":"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., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 272\u2013288. Springer, Heidelberg (2001)"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P.M. 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. Artificial Intelligence\u00a077(2), 321\u2013357 (1995)","journal-title":"Artificial Intelligence"},{"key":"12_CR20","unstructured":"Dung, P., Mancarella, P., Toni, F.: A dialectic procedure for sceptical, assumption-based argumentation. In: Proceedings of COMMA 2006, pp. 145\u2013156 (2006)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. In: Argumentation in Artificial Intelligence, pp. 85\u2013104. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"12_CR22","unstructured":"Dv\u01d2r\u00e1k, W., Gaggl, S.A., Wallner, J., Woltran, S.: Making use of advances in answer-set programming for abstract argumentation systems. In: Proceedings of INAP 2011 (2011)"},{"key":"12_CR23","unstructured":"Dv\u01d2r\u00e1k, W., J\u00e4rvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. In: Proceedings of KR 2012. AAAI Press (2012)"},{"key":"12_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/978-3-540-89982-2_67","volume-title":"Logic Programming","author":"U. Egly","year":"2008","unstructured":"Egly, U., Gaggl, S.A., Woltran, S.: Aspartix: Implementing argumentation frameworks using answer-set programming. In: de la Garcia Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 734\u2013738. Springer, Heidelberg (2008)"},{"issue":"4","key":"12_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S026988891200001X","volume":"27","author":"S. Jim\u00e9nez","year":"2012","unstructured":"Jim\u00e9nez, S., de la Rosa, T., Fern\u00e1ndez, S., Fern\u00e1ndez, F., Borrajo, D.: A review of machine learning for automated planning. Knowledge Engineering Review\u00a027(4), 433\u2013467 (2012)","journal-title":"Knowledge Engineering Review"},{"issue":"3","key":"12_CR26","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Argumentation in Artificial Intelligence, pp. 105\u2013129. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"12_CR28","unstructured":"Nofal, S., Dunne, P.E., Atkinson, K.: On preferred extension enumeration in abstract argumentation. In: Proceedings of COMMA 2012, pp. 205\u2013216 (2012)"},{"key":"12_CR29","unstructured":"South, M., Vreeswijk, G., Fox, J.: Dungine: A Java Dung reasoner. In: Proceedings of COMMA 2008, pp. 360\u2013368 (2008)"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Wallner, J.P., Weissenbacher, G., Woltran, S.: Advanced SAT techniques for abstract argumentation. In: Leite, J., Son, T.C., Torroni, P., van der Torre, L., Woltran, S. (eds.) CLIMA XIV 2013. LNCS (LNAI), vol.\u00a08143, pp. 138\u2013154. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40624-9_9"}],"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-642-54373-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:30:52Z","timestamp":1558834252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54373-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642543722","9783642543739"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54373-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}