{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:29:11Z","timestamp":1725618551880},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239625"},{"type":"electronic","value":"9783642239632"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23963-2_15","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T01:29:02Z","timestamp":1317864542000},"page":"177-190","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristics-Based Pruning Technique for Argumentation Trees"],"prefix":"10.1007","author":[{"given":"Nicol\u00e1s D.","family":"Rotstein","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Gottifredi","sequence":"additional","affiliation":[]},{"given":"Alejandro J.","family":"Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Guillermo R.","family":"Simari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Amgoud, L., Devred, C., Lagasquie, M.C.: A constrained argumentation system for practical reasoning. In: AAMAS 2008: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (May 12-16 (2008)"},{"key":"15_CR2","unstructured":"Baroni, P., Dunne, P.E., Giacomin, M.: Computational properties of resolution-based grounded semantics. In: IJCAI, pp. 683\u2013689 (2009)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.artint.2007.04.004","volume":"171","author":"P. Baroni","year":"2007","unstructured":"Baroni, P., Giacomin, M.: On Principle-Based Evaluation of Extension-Based Argumentation Semantics. Artif. Intell.\u00a0171, 675\u2013700 (2007)","journal-title":"Artif. Intell."},{"key":"15_CR4","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, 619\u2013641 (2007)","journal-title":"Artif. Intell."},{"issue":"1-2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0004-3702(01)00071-6","volume":"128","author":"P. Besnard","year":"2001","unstructured":"Besnard, P., Hunter, A.: A logic-based theory of deductive arguments. Artif. Intell.\u00a0128(1-2), 203\u2013235 (2001)","journal-title":"Artif. Intell."},{"key":"15_CR6","unstructured":"Besnard, P., Hunter, A.: Knowledgebase compilation for efficient logical argumentation. In: KR, pp. 123\u2013133 (2006)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-02906-6_11","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"G. Boella","year":"2009","unstructured":"Boella, G., Kaci, S., van der Torre, L.: Dynamics in argumentation with single extensions: Abstraction principles and the grounded extension. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol.\u00a05590, pp. 107\u2013118. Springer, Heidelberg (2009)"},{"key":"15_CR8","first-page":"127","volume":"11","author":"M. Capobianco","year":"2005","unstructured":"Capobianco, M., Ches\u00f1evar, C.I., Simari, G.R.: Argumentation and the dynamics of warranted beliefs in changing environments. JAAMAS\u00a011, 127\u2013151 (2005)","journal-title":"JAAMAS"},{"key":"15_CR9","unstructured":"Ches\u00f1evar, C.I., Simari, G.R., Garc\u00eda, A.J.: Pruning search space in defeasible argumentation. In: ATAI, pp. 46\u201355 (2000)"},{"issue":"2","key":"15_CR10","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":"1-2","key":"15_CR11","first-page":"95","volume":"4","author":"A.J. Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, A.J., Simari, G.R.: Defeasible logic programming: An argumentative approach. TPLP\u00a04(1-2), 95\u2013138 (2004)","journal-title":"TPLP"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Matt, P.A., Toni, F.: A game-theoretic measure of argument strength for abstract argumentation. In: JELIA, pp. 285\u2013297 (2008)","DOI":"10.1007\/978-3-540-87803-2_24"},{"key":"15_CR13","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.R., 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","key":"15_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.websem.2007.11.007","volume":"6","author":"I. Rahwan","year":"2008","unstructured":"Rahwan, I.: Mass argumentation and the semantic web. Journal of Web Semantics\u00a06(1), 29\u201337 (2008)","journal-title":"Journal of Web Semantics"},{"key":"15_CR15","unstructured":"Rotstein, N., Moguillansky, M., Garc\u00eda, A., Simari, G.: A Dynamic Argumentation Framework. In: COMMA, pp. 427\u2013438 (2010)"},{"key":"15_CR16","unstructured":"Rotstein, N.D., Moguillansky, M.O., Simari, G.R.: Dialectical abstract argumentation: A characterization of the marking criterion. In: IJCAI, pp. 898\u2013903 (2009)"}],"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-23963-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T03:35:57Z","timestamp":1554867357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23963-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239625","9783642239632"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23963-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}