{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:07:40Z","timestamp":1775736460154,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":28,"publisher":"Springer US","isbn-type":[{"value":"9780387981963","type":"print"},{"value":"9780387981970","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-98197-0_6","type":"book-chapter","created":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T04:00:16Z","timestamp":1244779216000},"page":"105-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":99,"title":["Proof Theories and Algorithms for Abstract Argumentation Frameworks"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Modgil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Caminada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,10]]},"reference":[{"issue":"1\u20133","key":"6_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1014490210693","volume":"34","author":"L. Amgoud","year":"2002","unstructured":"L. Amgoud and C. Cayrol. A Reasoning Model Based on the Production of Acceptable Arguments. Annals of Mathematics and Artificial Intelligence, 34(1\u20133),197\u2013215, 2002.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"H. Barringer, D. M. Gabbay and J. Woods. Temporal Dynamics of Support and Attack Networks: From Argumentation to Zoology. Mechanizing Mathematical Reasoning, 59\u201398, 2005.","DOI":"10.1007\/978-3-540-32254-2_5"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","volume":"93","author":"A. Bondarenko","year":"1997","unstructured":"A. Bondarenko and P.M. Dung and R.A. Kowalski and F. Toni. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence, 93:63\u2013101, 1997.","journal-title":"Artificial Intelligence"},{"key":"6_CR4","volume-title":"For the sake of the Argument. Explorations into argument-based reasoning","author":"M. Caminada","year":"2004","unstructured":"M. Caminada. For the sake of the Argument. Explorations into argument-based reasoning. Doctoral dissertation Free University Amsterdam, 2004."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"M. Caminada. On the Issue of Reinstatement in Argumentation. In European Conference on Logic in Artificial Intelligence (JELIA), 111\u2013123, 2006.","DOI":"10.1007\/11853886_11"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. Caminada. An Algorithm for Computing Semi-stable Semantics. In European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), 222\u2013234, 2007.","DOI":"10.1007\/978-3-540-75256-1_22"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"M. Caminada and Y. Wu. Towards an Argument Game for Stable Semantics. InComputational Models of Natural Argument, to appear, 2008.","DOI":"10.1093\/jigpal\/jzn029"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"C. Cayrol, S. Doutre and J. Mengin. Dialectical Proof Theories for the Credulous Preferred Semantics of Argumentation Frameworks. In European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), 668\u2013679, 2001.","DOI":"10.1007\/3-540-44652-4_59"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1093\/logcom\/13.3.377","volume":"13","author":"C. Cayrol","year":"2003","unstructured":"C. Cayrol, S. Doutre and J. Mengin. On Decision Problems related to the preferred semantics for argumentation frameworks. Journal of Logic and Computation, 13(3), 377\u2013403, 2003.","journal-title":"Journal of Logic and Computation"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"C. Cayrol and M. Lagasquie-Schiex. On the Acceptability of Arguments in Bipolar Argumentation Frameworks. In European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), 378\u2013389, 2005.","DOI":"10.1007\/11518655_33"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1613\/jair.1411","volume":"23","author":"C. Cayrol","year":"2005","unstructured":"C. Cayrol and M.-Ch. Lagasquie-Schiex. Graduality in argumentation. Journal of Artificial Intelligence Research, 23:245\u2013297, 2005.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"S. Doutre and J. Mengin. On sceptical vs credulous acceptance for abstract argument systems. In Ninth European Conference on Logics in Artificial Intelligence (JELIA 2004), 462\u2013473, 2004.","DOI":"10.1007\/978-3-540-30227-8_39"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P. M. Dung","year":"1995","unstructured":"P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77:321\u2013357, 1995.","journal-title":"Artificial Intelligence"},{"issue":"10\u201315","key":"6_CR14","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"P.M. Dung","year":"2007","unstructured":"P.M. Dung, P. Mancarella and F. Toni. Computing ideal sceptical argumentation. Artificial Intelligence Journal, 171(10\u201315):642\u2013674, 2007.","journal-title":"Artificial Intelligence Journal"},{"key":"6_CR15","unstructured":"P.M. Dung and P.M. Thang. A Sound and Complete Dialectical Proof Procedure for Sceptical Preferred Argumentation. In Proc. of the LPNMR-Workshop on Argumentation and Nonmonotonic Reasoning (ArgNMR07), 49\u201363, 2007."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0004-3702(03)00076-6","volume":"149","author":"P.E. Dunne","year":"2003","unstructured":"P.E. Dunne and T.J.M. Bench-Capon. Two Party Immediate Response Disputes: Properties and Efficiency. Artificial Intelligence Journal, 149(2),221\u2013250, 2003.","journal-title":"Artificial Intelligence Journal"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"H. Jakobovits and D. Vermeir. Dialectic Semantics for Argumentation Frameworks. Journal of Logic and Computation, 53\u201362, 1999.","DOI":"10.1145\/323706.323715"},{"key":"6_CR18","unstructured":"P. Lorenzen. Dialectical foundations of logical calculi. Constructive Philosophy, Univ. of Massachusetts Press, 1987."},{"key":"6_CR19","unstructured":"P. Lorenzen and K.Lorenz\u201d. Dialogische Logik. Wissenschaftliche Buchgesellschaft, Darmstadt, 1978."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"S. Modgil. An Abstract Theory of Argumentation That Accommodates Defeasible Reasoning About Preferences. In European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), 648\u2013659, 2007.","DOI":"10.1007\/978-3-540-75256-1_57"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"S. Modgil and M. Caminada. Proof Theories and Algorithms for Abstract Argumentation Frameworks. Technical Report, Department of Computer Science, King\u2019s College London, www.dcs.kcl.ac.uk\/staff\/modgilsa\/ProofTheoriesAlgorithms.pdf, 2008.","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"S. Nielsen and S. Parsons. A generalization of Dung\u2019s abstract framework for argumentation: Arguing with sets of attacking arguments. In Proc. Third International Workshop on Argumentation in Multiagent Systems (ArgMAS 2006), 54\u201373, 2006.","DOI":"10.1007\/978-3-540-75526-5_4"},{"key":"6_CR23","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1887.001.0001","volume-title":"Cognitive Carpentry. A Blueprint for How to Build a Person","author":"J. L. Pollock","year":"1995","unstructured":"J. L. Pollock. Cognitive Carpentry. A Blueprint for How to Build a Person. MIT Press, Cambridge, MA, 1995."},{"key":"6_CR24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/11663081.1997.10510900","volume":"7","author":"H. Prakken","year":"1997","unstructured":"H. Prakken and G. Sartor. Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics, 7:25\u201375, 1997.","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"6_CR25","unstructured":"B. Verheij. A Labeling Approach to the Computation of Credulous Acceptance in Argumentation. In International Joint Conference on Aritificial Intelligence (IJCAI), 623\u2013628, 2007."},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1093\/logcom\/3.3.317","volume":"3","author":"G. A. W. Vreeswijk","year":"1993","unstructured":"G. A. W. Vreeswijk. Defeasible dialectics: A controversy-oriented approach towards defeasible argumentation. Journal of Logic and Computation, 3:3\u201327, 1993.","journal-title":"Journal of Logic and Computation"},{"key":"6_CR27","unstructured":"G. A. W. Vreeswijk. An algorithm to compute minimally grounded and admissible defence sets in argument systems. In Proc. 1st International Conference on Computational Models of Argument, 109\u2013120, 2006."},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"G. A. W. Vreeswijk and H. Prakken. Credulous and sceptical argument games for preferred semantics. In Proc. 7th European Workshop on Logic for Artificial Intelligence, 239\u2013253, 2000.","DOI":"10.1007\/3-540-40006-0_17"}],"container-title":["Argumentation in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-98197-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:59:12Z","timestamp":1676681952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-98197-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387981963","9780387981970"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-98197-0_6","relation":{},"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"10 May 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}