{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:15:47Z","timestamp":1767651347857},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333613"},{"type":"electronic","value":"9783642333620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33362-0_7","type":"book-chapter","created":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T12:21:22Z","timestamp":1347366082000},"page":"85-98","source":"Crossref","is-referenced-by-count":11,"title":["Abstract Argumentation via Monadic Second Order Logic"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-23963-2_10","volume-title":"Scalable Uncertainty Management","author":"L. Amgoud","year":"2011","unstructured":"Amgoud, L., Devred, C.: Argumentation Frameworks as Constraint Satisfaction Problems. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol.\u00a06929, pp. 110\u2013122. Springer, Heidelberg (2011)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"3-4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.artint.2010.11.005","volume":"175","author":"P. Baroni","year":"2011","unstructured":"Baroni, P., Dunne, P.E., Giacomin, M.: On the resolution-based family of abstract argumentation semantics and its grounded instance. Artif. Intell.\u00a0175(3-4), 791\u2013813 (2011)","journal-title":"Artif. Intell."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence, pp. 25\u201344. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0_2"},{"issue":"1-2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"162","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. Artif. Intell.\u00a0168(1-2), 162\u2013210 (2005)","journal-title":"Artif. Intell."},{"issue":"10-15","key":"7_CR6","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2007.05.001","volume":"171","author":"T.J.M. Bench-Capon","year":"2007","unstructured":"Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artif. Intell.\u00a0171(10-15), 619\u2013641 (2007)","journal-title":"Artif. Intell."},{"key":"7_CR7","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Delgrande, J.P., Schaub, T. (eds.) Proc. NMR, pp. 59\u201364 (2004)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Campli, P., Santini, F.: Finding partitions of arguments with Dung\u2019s properties via SCSPs. In: Chu, W.C., Wong, W.E., Palakal, M.J., Hung, C.C. (eds.) Proc. SAC, pp. 913\u2013919. ACM (2011)","DOI":"10.1145\/1982185.1982384"},{"key":"7_CR9","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"issue":"6","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"7_CR11","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\u00a093(2), 109\u2013145 (2009)","journal-title":"Studia Logica"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic, a language theoretic approach, vol. 2012. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511977619"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"1-2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B. Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discr. Appl. Math.\u00a0108(1-2), 23\u201352 (2001)","journal-title":"Discr. Appl. Math."},{"key":"7_CR15","unstructured":"Courcelle, B.: Recognizability and second-order definability for sets of finite graphs. Tech. Rep. I-8634, Universit\u00e9 de Bordeaux (1987)"},{"key":"7_CR16","first-page":"193","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 193\u2013242. Elsevier, Amsterdam (1990)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0017394","volume-title":"Graph Grammars and Their Application to Computer Science","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Context-free Handle-rewriting Hypergraph Grammars. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol.\u00a0532, pp. 253\u2013268. Springer, Heidelberg (1991)"},{"issue":"2","key":"7_CR18","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. Artif. Intell.\u00a077(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"10-15","key":"7_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.artint.2007.03.006","volume":"171","author":"P.E. Dunne","year":"2007","unstructured":"Dunne, P.E.: Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell.\u00a0171(10-15), 701\u2013729 (2007)","journal-title":"Artif. Intell."},{"key":"7_CR20","unstructured":"Dvo\u0159\u00e1k, W., Szeider, S., Woltran, S.: Reasoning in argumentation frameworks of bounded clique-width. In: Baroni, P., Cerutti, F., Giacomin, M., Simari, G.R. (eds.) Proc. COMMA. FAIA, vol.\u00a0216, pp. 219\u2013230. IOS Press (2010)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.03.005","volume":"186","author":"W. Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell.\u00a0186, 1\u201337 (2012)","journal-title":"Artif. Intell."},{"issue":"11","key":"7_CR22","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.\u00a0110(11), 425\u2013430 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/19462166.2010.486479","volume":"1","author":"U. Egly","year":"2010","unstructured":"Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argument and Computation\u00a01(2), 147\u2013177 (2010)","journal-title":"Argument and Computation"},{"key":"7_CR24","unstructured":"Egly, U., Woltran, S.: Reasoning in argumentation frameworks using quantified boolean formulas. In: Dunne, P.E., Bench-Capon, T.J.M. (eds.) Proc. COMMA. FAIA, vol. 144, pp. 133\u2013144. IOS Press (2006)"},{"key":"7_CR25","unstructured":"Gaggl, S.A., Woltran, S.: cf2 semantics revisited. In: Baroni, P., Cerutti, F., Giacomin, M., Simari, G.R. (eds.) Proc. COMMA. FAIA, vol.\u00a0216, pp. 243\u2013254. IOS Press (2010)"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G. Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell.\u00a0174(1), 105\u2013132 (2010)","journal-title":"Artif. Intell."},{"issue":"3","key":"7_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/comjnl\/bxm056","volume":"51","author":"G. Gottlob","year":"2006","unstructured":"Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal\u00a051(3), 303\u2013325 (2006)","journal-title":"The Computer Journal"},{"issue":"4","key":"7_CR28","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.disopt.2011.06.001","volume":"8","author":"J. Kneis","year":"2011","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Courcelle\u2019s theorem - a game-theoretic approach. Discrete Optimization\u00a08(4), 568\u2013594 (2011)","journal-title":"Discrete Optimization"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Evaluation of an MSO-solver. In: Proc. of ALENEX 2012, pp. 55\u201363. SIAM (2012)","DOI":"10.1137\/1.9781611972924.5"},{"issue":"4","key":"7_CR30","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory, Ser. B\u00a096(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"14-15","key":"7_CR31","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1016\/j.artint.2011.07.001","volume":"175","author":"P. Tang","year":"2011","unstructured":"Tang, P., Lin, F.: Discovering theorems in game theory: Two-person games with unique pure nash equilibrium payoffs. Artif. Intell.\u00a0175(14-15), 2010\u20132020 (2011)","journal-title":"Artif. Intell."},{"key":"7_CR32","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-20832-4_11","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"F. Toni","year":"2011","unstructured":"Toni, F., Sergot, M.: Argumentation and Answer Set Programming. In: Balduccini, M., Son, T.C. (eds.) Gelfond Feschrift. LNCS (LNAI), vol.\u00a06565, pp. 164\u2013180. Springer, Heidelberg (2011)"},{"key":"7_CR33","unstructured":"Weydert, E.: Semi-stable extensions for infinite frameworks. In: Proc. BNAIC, pp. 336\u2013343 (2011)"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33362-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T17:47:52Z","timestamp":1687715272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33362-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333613","9783642333620"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33362-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}