{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T13:56:24Z","timestamp":1784555784102,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403804","type":"print"},{"value":"9783642403811","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40381-1_11","type":"book-chapter","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T21:49:06Z","timestamp":1378849746000},"page":"134-147","source":"Crossref","is-referenced-by-count":63,"title":["Ranking-Based Semantics for Argumentation Frameworks"],"prefix":"10.1007","author":[{"given":"Leila","family":"Amgoud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Ben-Naim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10472-011-9271-9","volume":"63","author":"L. Amgoud","year":"2011","unstructured":"Amgoud, L., Vesic, S.: A new approach for preference-based argumentation frameworks. Annals of Mathematics and Artificial Intelligence\u00a063(2), 149\u2013183 (2011)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"10-15","key":"11_CR2","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. Artificial Intelligence\u00a0171(10-15), 675\u2013700 (2007)","journal-title":"Artificial Intelligence"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.artint.2005.05.006","volume":"168","author":"P. Baroni","year":"2005","unstructured":"Baroni, P., Giacomin, M., Guida, G.: Scc-recursiveness: a general schema for argumentation semantics. Artificial Intelligence Journal\u00a0168, 162\u2013210 (2005)","journal-title":"Artificial Intelligence Journal"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1613\/jair.1411","volume":"23","author":"C. Cayrol","year":"2005","unstructured":"Cayrol, C., Lagasquie-Schiex, M.-C.: Graduality in Argumentation. Journal of Artificial Intelligence Research (JAIR)\u00a023, 245\u2013297 (2005)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"P. Dung","year":"2007","unstructured":"Dung, P., Mancarella, P., Toni, F.: Computing ideal skeptical argumentation. Artificial Intelligence Journal\u00a0171, 642\u2013674 (2007)","journal-title":"Artificial Intelligence Journal"},{"key":"11_CR6","first-page":"321","volume":"77","author":"P.M. Dung","year":"1995","unstructured":"Dung, P.M.: On the Acceptability of Arguments and its Fundamental Role in Non-Monotonic Reasoning, Logic Programming and n-Person Games. AIJ\u00a077, 321\u2013357 (1995)","journal-title":"AIJ"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.artint.2010.09.005","volume":"175","author":"P.E. Dunne","year":"2011","unstructured":"Dunne, P.E., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Weighted argument systems: Basic definitions, algorithms, and complexity results. Artificial Intelligence\u00a0175(2), 457\u2013486 (2011)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"11_CR8","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-2), 95\u2013138 (2004)","journal-title":"Theory and Practice of Logic Programming"}],"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-40381-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T04:58:36Z","timestamp":1558069116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40381-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403804","9783642403811"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40381-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}