{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:33:27Z","timestamp":1725568407333},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169519"},{"type":"electronic","value":"9783642169526"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16952-6_5","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:52:47Z","timestamp":1288705967000},"page":"40-49","source":"Crossref","is-referenced-by-count":1,"title":["A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Alsinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Llu\u00eds","family":"Godo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1016\/j.fss.2007.12.013","volume":"159","author":"T. Alsinet","year":"2008","unstructured":"Alsinet, T., Ches\u00f1evar, C.I., Godo, L., Simari, G.: A logic programming framework for possibilistic argumentation: Formalization and logical properties. Fuzzy Sets and Systems\u00a0159(10), 1208\u20131228 (2008)","journal-title":"Fuzzy Sets and Systems"},{"key":"5_CR2","unstructured":"Alsinet, T., B\u00e9jar, R., Godo, L.: A characterization of collective conflict for defeasible argumentation. In: Proc. of COMMA 2010, pp. 27\u201338 (2010)"},{"key":"5_CR3","unstructured":"Alsinet, T., Ches\u00f1evar, C.I., Godo, L.: A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic. In: Proc. of COMMA 2008, pp. 1\u201312 (2008)"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262026437.001.0001","volume-title":"Elements of Argumentation","author":"P. Besnard","year":"2008","unstructured":"Besnard, P., Hunter, A.: Elements of Argumentation. The MIT Press, Cambridge (2008)"},{"key":"5_CR5","doi-asserted-by":"publisher","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.\u00a093, 63\u2013101 (1997)","journal-title":"Artif. Intell."},{"issue":"5-6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.artint.2007.02.003","volume":"171","author":"M. Caminada","year":"2007","unstructured":"Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artif. Intell.\u00a0171(5-6), 286\u2013310 (2007)","journal-title":"Artif. Intell."},{"key":"5_CR7","unstructured":"Cecchi, L., Fillottrani, P., Simari, G.: On the complexity of DeLP through game semantics. In: Proc. of NMR 2006, pp. 386\u2013394 (2006)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/371578.371581","volume":"32","author":"C.I. Ches\u00f1evar","year":"2000","unstructured":"Ches\u00f1evar, C.I., Maguitman, A., Loui, R.: Logical Models of Argument. ACM Computing Surveys\u00a032(4), 337\u2013383 (2000)","journal-title":"ACM Computing Surveys"},{"key":"5_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11546207_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C.I. Ches\u00f1evar","year":"2005","unstructured":"Ches\u00f1evar, C.I., Simari, G., Godo, L.: Computing dialectical trees efficiently in possibilistic defeasible logic programming. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 158\u2013171. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"5_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. Theoretical Computer Science\u00a0170(1-2), 209\u2013244 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR11","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."},{"key":"5_CR12","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: A dialectic procedure for sceptical, assumption-based argumentation. In: Proc. of COMMA 2006, pp. 145\u2013156 (2006)"},{"issue":"10-15","key":"5_CR13","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"P.M. Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell.\u00a0171(10-15), 642\u2013674 (2007)","journal-title":"Artif. Intell."},{"issue":"18","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1016\/j.artint.2009.09.001","volume":"173","author":"P.E. Dunne","year":"2009","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics. Artif. Intell.\u00a0173(18), 1559\u20131591 (2009)","journal-title":"Artif. Intell."},{"issue":"1-2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","volume":"141","author":"P.E. Dunne","year":"2002","unstructured":"Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artif. Intell.\u00a0141(1-2), 187\u2013203 (2002)","journal-title":"Artif. Intell."},{"key":"5_CR16","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics i: Abstract argumentation frameworks. In: Proc. of COMMA 2008, pp. 147\u2013158 (2008)"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068403001674","volume":"4","author":"A. Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, A., Simari, G.: Defeasible Logic Programming: An Argumentative Approach. Theory and Practice of Logic Programming\u00a04(1), 95\u2013138 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Hirsch, R., Gorogiannis, N.: The complexity of the warranted formula problem in propositional argumentation. J. of Logic and Computation\u00a020(2) (2009)","DOI":"10.1093\/logcom\/exp074"},{"key":"5_CR19","series-title":"ch. 9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-0-387-98197-0_9","volume-title":"Argumentation in Artificial Intelligence","author":"J.L. Pollock","year":"2009","unstructured":"Pollock, J.L.: A recursive semantics for defeasible reasoning. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence. ch. 9, pp. 173\u2013198. Springer, Heidelberg (2009)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/11663081.1997.10510900","volume":"7","author":"H. Prakken","year":"1997","unstructured":"Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. J. of Applied Non-classical Logics\u00a07, 25\u201375 (1997)","journal-title":"J. of Applied Non-classical Logics"},{"key":"5_CR21","first-page":"219","volume-title":"Handbook of Phil. Logic","author":"H. Prakken","year":"2002","unstructured":"Prakken, H., Vreeswijk, G.: Logical Systems for Defeasible Argumentation. In: Gabbay, D., Guenther, F. (eds.) Handbook of Phil. Logic, pp. 219\u2013318. Kluwer, Dordrecht (2002)"},{"volume-title":"Argumentation in Artificial Intelligence","year":"2009","key":"5_CR22","unstructured":"Rahwan, I., Simari, G. (eds.): Argumentation in Artificial Intelligence. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16952-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T01:05:09Z","timestamp":1553216709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16952-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169519","9783642169526"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16952-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}