{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:05:04Z","timestamp":1742969104838,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031742088"},{"type":"electronic","value":"9783031742095"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_21","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"276-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semantic-Based Arguments Using Logic Programming Rewriting Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6035-800X","authenticated-orcid":false,"given":"Esteban","family":"Guerrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4072-8795","authenticated-orcid":false,"given":"Juan Carlos","family":"Nieves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"issue":"9","key":"21_CR1","doi-asserted-by":"publisher","first-page":"2028","DOI":"10.1016\/j.ijar.2013.10.004","volume":"55","author":"L Amgoud","year":"2014","unstructured":"Amgoud, L.: Postulates for logic-based argumentation systems. Int. J. Approximate Reasoning 55(9), 2028\u20132048 (2014)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0269888911000166","volume":"26","author":"P Baroni","year":"2011","unstructured":"Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365\u2013410 (2011)","journal-title":"Knowl. Eng. Rev."},{"issue":"1","key":"21_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. 93(1), 63\u2013101 (1997)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Bondarenko, A., Toni, F., Kowalski, R.A.: An assumption-based framework for non-monotonic reasoning. In: LPNMR, vol.\u00a093, pp. 171\u2013189 (1993)","key":"21_CR4","DOI":"10.7551\/mitpress\/4307.003.0016"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BFb0023807","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"S Brass","year":"1997","unstructured":"Brass, S., Zukowski, U., Freitag, B.: Transformation-based bottom-up computation of the well-founded model. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) NMELP 1996. LNCS, vol. 1216, pp. 171\u2013201. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023807"},{"issue":"5\u20136","key":"21_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. 171(5\u20136), 286\u2013310 (2007)","journal-title":"Artif. Intell."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1613\/jair.5581","volume":"60","author":"M Caminada","year":"2017","unstructured":"Caminada, M., Schulz, C.: On the equivalence between assumption-based argumentation and logic programming. J. Artif. Intell. Res. 60, 779\u2013825 (2017)","journal-title":"J. Artif. Intell. Res."},{"unstructured":"Dix, J.: A framework for representing and characterizing semantics of logic programs. In: Nebel, B., Rich, C., Swartout, W.R. (eds.) Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR 1992), Cambridge, MA, USA, 25\u201329 October 1992, pp. 591\u2013602. Morgan Kaufmann (1992)","key":"21_CR8"},{"doi-asserted-by":"crossref","unstructured":"Dix, J.: A classification theory of semantics of normal logic programs: I. Strong properties. Fundam. Inform. 22(3), 227\u2013255 (1995)","key":"21_CR9","DOI":"10.3233\/FI-1995-2233"},{"issue":"1\u20133","key":"21_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0168-0072(00)00044-0","volume":"108","author":"J Dix","year":"2001","unstructured":"Dix, J., Osorio, M., Zepeda, C.: A general theory of confluent rewriting systems for logic programming and its applications. Ann. Pure Appl. Logic 108(1\u20133), 153\u2013188 (2001)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM 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. 77(2), 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with Clingo 5. In: Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)","key":"21_CR12"},{"unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, vol.\u00a088, pp. 1070\u20131080. Cambridge, MA (1988)","key":"21_CR13"},{"issue":"3\u20134","key":"21_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. N. Gener. Comput. 9(3\u20134), 365\u2013385 (1991)","journal-title":"N. Gener. Comput."},{"unstructured":"de\u00a0Graaf, M.M.A., Malle, B.F.: How people explain action (and autonomous intelligent systems should too). In: 2017 AAAI Fall Symposia, Arlington, Virginia, USA, 9\u201311 November 2017, pp. 19\u201326. AAAI Press (2017)","key":"21_CR15"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ijar.2015.06.009","volume":"64","author":"E Guerrero","year":"2015","unstructured":"Guerrero, E., Nieves, J.C., Lindgren, H.: Semantic-based construction of arguments: an answer set programming approach. Int. J. Approximate Reasoning 64, 54\u201374 (2015)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"5","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1093\/logcom\/exu014","volume":"26","author":"JC Nieves","year":"2016","unstructured":"Nieves, J.C., Osorio, M.: Ideal extensions as logical programming models. J. Log. Comput. 26(5), 1361\u20131393 (2016)","journal-title":"J. Log. Comput."},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/19462160903564592","volume":"1","author":"H Prakken","year":"2010","unstructured":"Prakken, H.: An abstract framework for argumentation with structured arguments. Argument Comput. 1(2), 93\u2013124 (2010)","journal-title":"Argument Comput."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ijar.2017.02.005","volume":"84","author":"C Schulz","year":"2017","unstructured":"Schulz, C., Toni, F.: Labellings for assumption-based and abstract argumentation. Int. J. Approximate Reasoning 84, 110\u2013149 (2017)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/19462166.2013.869878","volume":"5","author":"F Toni","year":"2014","unstructured":"Toni, F.: A tutorial on assumption-based argumentation. Argument Comput. 5(1), 89\u2013117 (2014)","journal-title":"Argument Comput."},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 619\u2013649 (1991)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:03:24Z","timestamp":1736615004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}