{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:44:59Z","timestamp":1762101899029,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448312"},{"type":"electronic","value":"9783319448329"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44832-9_4","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T10:24:12Z","timestamp":1470738252000},"page":"61-75","source":"Crossref","is-referenced-by-count":5,"title":["Resistance to Corruption of General Strategic Argumentation"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Maher","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,10]]},"reference":[{"key":"4_CR1","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: A flexible framework for defeasible logics. In: AAAI\/IAAI, pp. 405\u2013410. AAAI Press\/The MIT Press (2000)"},{"issue":"4","key":"4_CR2","doi-asserted-by":"crossref","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. Knowl. Eng. Rev. 26(4), 365\u2013410 (2011). http:\/\/dx.doi.org\/10.1017\/S0269888911000166","journal-title":"Knowl. Eng. Rev."},{"issue":"3","key":"4_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi","year":"1989","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"key":"4_CR4","unstructured":"Baumann, R., Brewka, G.: Expanding argumentation frameworks: enforcing and monotonicity results. In: COMMA, pp. 75\u201386 (2010)"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","volume":"93","author":"A Bondarenko","year":"1997","unstructured":"Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93, 63\u2013101 (1997)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"4_CR6","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. Theor. Comput. Sci. 170(1\u20132), 209\u2013244 (1996). http:\/\/dx.doi.org\/10.1016\/S0304-3975(96)80707\u20139","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR7","doi-asserted-by":"crossref","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":"18","key":"4_CR8","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1016\/j.artint.2009.09.001","volume":"173","author":"PE Dunne","year":"2009","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics. Artif. Intell. 173(18), 1559\u20131591 (2009). http:\/\/dx.doi.org\/10.1016\/j.artint.2009.09.001","journal-title":"Artif. Intell."},{"issue":"1\/2","key":"4_CR9","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1016\/S0004-3702(02)00261\u20138","journal-title":"Artif. Intell."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2013.06.004","volume":"202","author":"PE Dunne","year":"2013","unstructured":"Dunne, P.E., Dvo\u0159\u00e1k, W., Woltran, S.: Parametric properties of ideal semantics. Artif. Intell. 202, 1\u201328 (2013). http:\/\/dx.doi.org\/10.1016\/j.artint.2013.06.004","journal-title":"Artif. Intell."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-642-29184-5_3","volume-title":"Theorie and Applications of Formal Argumentation","author":"W Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, W.: On the complexity of computing the justification status of an argument. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 32\u201349. Springer, Heidelberg (2012)"},{"issue":"11","key":"4_CR12","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1016\/j.ipl.2010.04.005","journal-title":"Inf. Process. Lett."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-0-387-98197-0_12","volume-title":"Argumentation in Artificial Intelligence","author":"TF Gordon","year":"2009","unstructured":"Gordon, T.F., Walton, D.: Proof burdens and standards. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence, pp. 239\u2013260. Springer, Heidelberg (2009)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M.: Strategic argumentation is NP-complete. In: Proceedings of the European Conference on Artificial Intelligence, pp. 399\u2013404 (2014)","DOI":"10.3233\/978-1-61499-419-0-399"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: A catalog of complexity classes. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 67\u2013161. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Complexity of exploiting privacy violations in strategic argumentation. In: Proceedings of the Pacific Rim International Conference on Artificial Intelligence, pp. 523\u2013535 (2014)","DOI":"10.1007\/978-3-319-13560-1_42"},{"key":"4_CR17","unstructured":"Maher, M.J.: Relating concrete argumentation formalisms and abstract argumentation. In: Technical Communications of International Conference on Logic Programming (2015)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Resistance to corruption of strategic argumentation. In: AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1007\/978-3-319-44832-9_4"},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/19462160903564592","volume":"1","author":"H Prakken","year":"2010","unstructured":"Prakken, H.: An abstract framework for argumentation with structured arguments. Argument Comput. 1, 93\u2013124 (2010)","journal-title":"Argument Comput."},{"key":"4_CR20","unstructured":"Rahwan, I., Larson, K., Tohm\u00e9, F.A.: A characterisation of strategy-proofness for grounded argumentation semantics. In: Boutilier, C. (ed.) IJCAI, pp. 251\u2013256 (2009)"},{"issue":"5","key":"4_CR21","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991). http:\/\/dx.doi.org\/10.1137\/0220053","journal-title":"SIAM J. Comput."},{"issue":"3","key":"4_CR22","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/116825.116858","volume":"38","author":"J Tor\u00e1n","year":"1991","unstructured":"Tor\u00e1n, J.: Complexity classes defined by counting quantifiers. J. ACM 38(3), 753\u2013774 (1991). http:\/\/doi.acm.org\/10.1145\/116825.116858","journal-title":"J. ACM"},{"issue":"3","key":"4_CR23","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","volume":"23","author":"KW Wagner","year":"1986","unstructured":"Wagner, K.W.: The complexity of combinatorial problems with succinct input representation. Acta Inf. 23(3), 325\u2013356 (1986). http:\/\/dx.doi.org\/10.1007\/BF00289117","journal-title":"Acta Inf."},{"issue":"4","key":"4_CR24","first-page":"12","volume":"3","author":"Y Wu","year":"2010","unstructured":"Wu, Y., Caminada, M.: A labelling-based justification status of arguments. Stud. Logic 3(4), 12\u201329 (2010)","journal-title":"Stud. Logic"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2016: Princiles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44832-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T16:26:53Z","timestamp":1749054413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44832-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448312","9783319448329"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44832-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}