乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:20:27Z","timestamp":1725618027322},"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_9","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T01:29:02Z","timestamp":1317864542000},"page":"96-109","source":"Crossref","is-referenced-by-count":4,"title":["Maximal Ideal Recursive Semantics for Defeasible Argumentation"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Alsinet","sequence":"first","affiliation":[]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[]},{"given":"Lluis","family":"Godo","sequence":"additional","affiliation":[]},{"given":"Francesc","family":"Guitart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Alsinet, T., B\u00e9jar, R., Godo, L.: A characterization of collective conflict for defeasible argumentation. In: COMMA, pp. 27\u201338 (2010)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-16952-6_5","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2010","author":"T. Alsinet","year":"2010","unstructured":"Alsinet, T., B\u00e9jar, R., Godo, L.: A computational method for defeasible argumentation based on a recursive warrant semantics. In: Kuri-Morales, A., Simari, G.R. (eds.) IBERAMIA 2010. LNCS, vol.\u00a06433, pp. 40\u201349. Springer, Heidelberg (2010)"},{"key":"9_CR3","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":"9_CR4","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":"9_CR5","unstructured":"Cecchi, L., Fillottrani, P., Simari, G.: On the complexity of delp through game semantics. In: NMR, pp. 386\u2013394 (2006)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/371578.371581","volume":"32","author":"C. Ches\u00f1evar","year":"2000","unstructured":"Ches\u00f1evar, C., Maguitman, A., Loui, R.: Logical Models of Argument. ACM Computing Surveys\u00a032(4), 337\u2013383 (2000)","journal-title":"ACM Computing Surveys"},{"key":"9_CR7","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. Ches\u00f1evar","year":"2005","unstructured":"Ches\u00f1evar, C., 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":"2","key":"9_CR8","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":"9_CR9","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: A dialectic procedure for sceptical, assumption-based argumentation. In: COMMA, pp. 145\u2013156 (2006)"},{"issue":"10-15","key":"9_CR10","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."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Een","year":"2004","unstructured":"Een, N., Sorensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"1","key":"9_CR12","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":"9_CR13","unstructured":"Kautz, H.A., Selman, B.: Unifying sat-based and graph-based planning. In: IJCAI, pp. 318\u2013325 (1999)"},{"key":"9_CR14","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.R. (eds.) Argumentation in Artificial Intelligence. ch.9, pp. 173\u2013198. Springer, Heidelberg (2009)"},{"key":"9_CR15","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)"},{"issue":"1-2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0004-3702(96)00041-0","volume":"90","author":"G. Vreeswijk","year":"1997","unstructured":"Vreeswijk, G.: Abstract argumentation systems. Artif. Intell.\u00a090(1-2), 225\u2013279 (1997)","journal-title":"Artif. Intell."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T03:22:50Z","timestamp":1554866570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23963-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239625","9783642239632"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23963-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}