{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:30:16Z","timestamp":1725748216264},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403804"},{"type":"electronic","value":"9783642403811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40381-1_6","type":"book-chapter","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T21:49:06Z","timestamp":1378849746000},"page":"71-77","source":"Crossref","is-referenced-by-count":1,"title":["On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation"],"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":"Lluis","family":"Godo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Guitart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Alsinet, T., B\u00e9jar, R., Godo, L.: A characterization of collective conflict for defeasible argumentation. In: COMMA 2010, pp. 27\u201338 (2010)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-23963-2_9","volume-title":"Scalable Uncertainty Management","author":"T. Alsinet","year":"2011","unstructured":"Alsinet, T., B\u00e9jar, R., Godo, L., Guitart, F.: Maximal ideal recursive semantics for defeasible argumentation. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol.\u00a06929, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Alsinet, T., B\u00e9jar, R., Godo, L., Guitart, F.: Using answer set programming for an scalable implementation of defeasible argumentation. In: ICTAI 2012, pp. 1016\u20131021 (2012)","DOI":"10.1109\/ICTAI.2012.171"},{"key":"6_CR4","unstructured":"Amgoud, L.: Postulates for logic-based argumentation systems. In: ECAI 2012 Workshop WL4AI, pp. 59\u201367 (2012)"},{"key":"6_CR5","unstructured":"Cecchi, L., Fillottrani, P., Simari, G.: On the complexity of DeLP through game semantics. In: NMR 2006, pp. 386\u2013394 (2006)"},{"key":"6_CR6","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)"},{"key":"6_CR7","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. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, 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":"6_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.R.: 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":"6_CR9","doi-asserted-by":"crossref","unstructured":"Pollock, J.L.: A recursive semantics for defeasible reasoning. In: Rahwan, Simari (eds.) Argumentation in Artificial Intelligence, pp. 173\u2013198. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0_9"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T21:36:22Z","timestamp":1563917782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40381-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403804","9783642403811"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40381-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}