{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:53:11Z","timestamp":1742968391229,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031243486"},{"type":"electronic","value":"9783031243493"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-24349-3_18","type":"book-chapter","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T10:09:17Z","timestamp":1680516557000},"page":"347-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Argumentation in\u00a0AI"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8611-2377","authenticated-orcid":false,"given":"Bettina","family":"Fazzinga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4138-937X","authenticated-orcid":false,"given":"Ren\u00e9","family":"Mellema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,4]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ijar.2007.07.004","volume":"48","author":"T Alsinet","year":"2008","unstructured":"Alsinet, T., Ches\u00f1evar, C.I., Godo, L., Sandri, S.A., Simari, G.R.: Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification. Int. J. Approx. Reasoning 48(3), 711\u2013729 (2008). https:\/\/doi.org\/10.1016\/j.ijar.2007.07.004","journal-title":"Int. J. Approx. Reasoning"},{"issue":"10","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1016\/j.fss.2007.12.013","volume":"159","author":"T Alsinet","year":"2008","unstructured":"Alsinet, T., Ches\u00f1evar, C.I., Godo, L., Simari, G.R.: A logic programming framework for possibilistic argumentation: Formalization and logical properties. Fuzzy Sets Syst. 159(10), 1208\u20131228 (2008). https:\/\/doi.org\/10.1016\/j.fss.2007.12.013","journal-title":"Fuzzy Sets Syst."},{"issue":"1\u20133","key":"18_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1014490210693","volume":"34","author":"L Amgoud","year":"2002","unstructured":"Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Ann. Math. Artif. Intell. 34(1\u20133), 197\u2013215 (2002). https:\/\/doi.org\/10.1023\/A:1014490210693","journal-title":"Ann. Math. Artif. Intell."},{"key":"18_CR4","unstructured":"Amgoud, L., Prade, H.: Reaching agreement through argumentation: a possibilistic approach. In: Proceedings of Principles of Knowledge Representation and Reasoning: KR, Whistler, Canada, 2\u20135 June, pp. 175\u2013182 (2004)"},{"issue":"2","key":"18_CR5","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. Ann. Math. Artif. Intell. 63(2), 149\u2013183 (2011). https:\/\/doi.org\/10.1007\/s10472-011-9271-9","journal-title":"Ann. Math. Artif. Intell."},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_2","volume-title":"Argumentation in Artificial Intelligence","author":"P Baroni","year":"2009","unstructured":"Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0_2"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1093\/logcom\/13.3.429","volume":"13","author":"TJM Bench-Capon","year":"2003","unstructured":"Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429\u2013448 (2003). https:\/\/doi.org\/10.1093\/logcom\/13.3.429","journal-title":"J. Log. Comput."},{"key":"18_CR8","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of Computational Models of Argument: COMMA, 11\u201312 September, Liverpool, UK, pp. 121\u2013130 (2006)"},{"key":"18_CR9","unstructured":"Coste-Marquis, S., Konieczny, S., Marquis, P., Ouali, M.A.: Weighted attacks in argumentation frameworks. In: Proceedings of Principles of Knowledge Representation and Reasoning: KR, Rome, Italy, 10\u201314 June (2012)"},{"key":"18_CR10","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Preferred arguments are harder to compute than stable extension. In: Dean, T. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, 31 July - 6 August 1999, 2 volumes, 1450 p, pp. 36\u201343. Morgan Kaufmann (1999), http:\/\/ijcai.org\/Proceedings\/99-1\/Papers\/006.pdf"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-11508-5_12","volume-title":"Scalable Uncertainty Management","author":"D Doder","year":"2014","unstructured":"Doder, D., Woltran, S.: Probabilistic argumentation frameworks \u2013 a logical approach. In: Straccia, U., Cal\u00ec, A. (eds.) SUM 2014. LNCS (LNAI), vol. 8720, pp. 134\u2013147. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11508-5_12"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1080\/01969722.2014.894854","volume":"45","author":"P Dondio","year":"2014","unstructured":"Dondio, P.: Toward a computational analysis of probabilistic argumentation frameworks. Cybern. Syst. 45(3), 254\u2013278 (2014). https:\/\/doi.org\/10.1080\/01969722.2014.894854","journal-title":"Cybern. Syst."},{"key":"18_CR13","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, 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"10\u201315","key":"18_CR14","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"PM Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell. 171(10\u201315), 642\u2013674 (2007). https:\/\/doi.org\/10.1016\/j.artint.2007.05.003","journal-title":"Artif. Intell."},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Dung, P.M., Thang, P.M.: Towards (probabilistic) argumentation for jury-based dispute resolution. In: Proceedings of Computational Models of Argument: COMMA, Desenzano del Garda, Italy, 8\u201310 September, pp. 171\u2013182 (2010). https:\/\/doi.org\/10.3233\/978-1-60750-619-5-171","DOI":"10.3233\/978-1-60750-619-5-171"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.artint.2010.09.005","volume":"175","author":"PE Dunne","year":"2011","unstructured":"Dunne, P.E., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Weighted argument systems: basic definitions, algorithms, and complexity results. Artif. Intell. 175(2), 457\u2013486 (2011). https:\/\/doi.org\/10.1016\/j.artint.2010.09.005","journal-title":"Artif. Intell."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-0-387-98197-0_5","volume-title":"Argumentation in Artificial Intelligence","author":"PE Dunne","year":"2009","unstructured":"Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 85\u2013104. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0_5"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Fazzinga, B., Flesca, S., Furfaro, F.: Computing extensions\u2019 probabilities in probabilistic abstract argumentation: beyond independence. In: Proceedings of ECAI - 22nd European Conference on Artificial Intelligence, 29 August-2 September, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS), pp. 1588\u20131589 (2016). https:\/\/doi.org\/10.3233\/978-1-61499-672-9-1588","DOI":"10.3233\/978-1-61499-672-9-1588"},{"key":"18_CR19","unstructured":"Fazzinga, B., Flesca, S., Furfaro, F.: Credulous acceptability in probabilistic abstract argumentation: Complexity results. In: Proceedings of the 1st Workshop on Advances in Argumentation in Artificial Intelligence Co-located with XVI International Conference of the Italian Association for Artificial Intelligence (AI*IA), Bari, Italy, 16\u201317 November, pp. 43\u201357 (2017)"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.11.003","volume":"268","author":"B Fazzinga","year":"2019","unstructured":"Fazzinga, B., Flesca, S., Furfaro, F.: Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence. Artif. Intell. 268, 1\u201329 (2019). https:\/\/doi.org\/10.1016\/j.artint.2018.11.003","journal-title":"Artif. Intell."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-40381-1_9","volume-title":"Scalable Uncertainty Management","author":"B Fazzinga","year":"2013","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: Efficiently estimating the probability of extensions in abstract argumentation. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS (LNAI), vol. 8078, pp. 106\u2013119. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40381-1_9"},{"key":"18_CR22","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: On the complexity of probabilistic abstract argumentation. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), Beijing, China, 3\u20139, August, pp. 898\u2013904 (2013)"},{"issue":"3","key":"18_CR23","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/2749463","volume":"16","author":"B Fazzinga","year":"2015","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: On the complexity of probabilistic abstract argumentation frameworks. ACM Trans. Comput. Log. 16(3), 22:1-22:39 (2015). https:\/\/doi.org\/10.1145\/2749463","journal-title":"ACM Trans. Comput. Log."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ijar.2015.11.009","volume":"69","author":"B Fazzinga","year":"2016","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: On efficiently estimating the probability of extensions in abstract argumentation frameworks. Int. J. Approx. Reasoning 69, 106\u2013132 (2016). https:\/\/doi.org\/10.1016\/j.ijar.2015.11.009","journal-title":"Int. J. Approx. Reasoning"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Hunter, A.: Some Foundations for Probabilistic Abstract Argumentation. In: Proceedings of Computational Models of Argument: COMMA, Vienna, Austria, 10\u201312 September, pp. 117\u2013128 (2012). https:\/\/doi.org\/10.3233\/978-1-61499-111-3-117","DOI":"10.3233\/978-1-61499-111-3-117"},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ijar.2012.08.003","volume":"54","author":"A Hunter","year":"2013","unstructured":"Hunter, A.: A probabilistic approach to modelling uncertain logical arguments. Int. J. Approx. Reasoning 54(1), 47\u201381 (2013). https:\/\/doi.org\/10.1016\/j.ijar.2012.08.003","journal-title":"Int. J. Approx. Reasoning"},{"issue":"2","key":"18_CR27","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.ijar.2013.09.002","volume":"55","author":"A Hunter","year":"2014","unstructured":"Hunter, A.: Probabilistic qualification of attack in abstract argumentation. Int. J. Approx. Reasoning 55(2), 607\u2013638 (2014). https:\/\/doi.org\/10.1016\/j.ijar.2013.09.002","journal-title":"Int. J. Approx. Reasoning"},{"key":"18_CR28","unstructured":"Hunter, A., Thimm, M.: Probabilistic argumentation with epistemic extensions. In: Proceedings of the International Workshop on Defeasible and Ampliative Reasoning, DARe@ECAI, Co-located with the 21st European Conference on Artificial Intelligence (ECAI), Prague, Czech Republic, 19 August (2014)"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Hunter, A., Thimm, M.: Probabilistic argumentation with incomplete information. In: Proceedings of the 21st European Conference on Artificial Intelligence (ECAI), 18\u201322 August, Prague, Czech Republic. Including Prestigious Applications of Intelligent Systems (PAIS), pp. 1033\u20131034 (2014). https:\/\/doi.org\/10.3233\/978-1-61499-419-0-1033","DOI":"10.3233\/978-1-61499-419-0-1033"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-29184-5_1","volume-title":"Theorie and Applications of Formal Argumentation","author":"H Li","year":"2012","unstructured":"Li, H., Oren, N., Norman, T.J.: Probabilistic argumentation frameworks. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol. 7132, pp. 1\u201316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29184-5_1"},{"issue":"9\u201310","key":"18_CR31","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.artint.2009.02.001","volume":"173","author":"S Modgil","year":"2009","unstructured":"Modgil, S.: Reasoning about preferences in argumentation frameworks. Artif. Intell. 173(9\u201310), 901\u2013934 (2009). https:\/\/doi.org\/10.1016\/j.artint.2009.02.001","journal-title":"Artif. Intell."},{"key":"18_CR32","unstructured":"Rienstra, T.: Towards a probabilistic dung-style argumentation system. In: Proceedings of the First International Conference on Agreement Technologies, AT 2012, Dubrovnik, Croatia, 15\u201316 October, pp. 138\u2013152 (2012)"},{"key":"18_CR33","doi-asserted-by":"publisher","unstructured":"Thimm, M.: A probabilistic semantics for abstract argumentation. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI). Including Prestigious Applications of Artificial Intelligence (PAIS) System Demonstrations Track, Montpellier, France, 27\u201331 August, pp. 750\u2013755 (2012). https:\/\/doi.org\/10.3233\/978-1-61499-098-7-750","DOI":"10.3233\/978-1-61499-098-7-750"},{"key":"18_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979). https:\/\/doi.org\/10.1016\/0304-3975(79)90044-6","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Human-Centered Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24349-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T10:23:12Z","timestamp":1680517392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24349-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031243486","9783031243493"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24349-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ECCAI Advanced Course on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acai-agents2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.humane-ai.eu\/event\/acai2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}