{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T08:46:16Z","timestamp":1770885976509,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031556296","type":"print"},{"value":"9783031556302","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55630-2_8","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:26Z","timestamp":1710831086000},"page":"100-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Assumption-Based Argumentation Frameworks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3835-4931","authenticated-orcid":false,"given":"Maurizio","family":"Proietti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8194-1459","authenticated-orcid":false,"given":"Francesca","family":"Toni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0743-1066(94)00104-E","volume":"24","author":"C Aravindan","year":"1995","unstructured":"Aravindan, C., Dung, P.M.: On the correctness of unfold\/fold transformation of normal and extended logic programs. J. Log. Program. 24(3), 201\u2013217 (1995)","journal-title":"J. Log. Program."},{"key":"8_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, 63\u2013101 (1997)","journal-title":"Artif. Intell."},{"key":"8_CR4","unstructured":"Cyras, K., Fan, X., Schulz, C., Toni, F.: Assumption-based argumentation: disputes, explanations, preferences. FLAP 4(8), 2407\u20132455 (2017)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cyras, K., Rago, A., Albini, E., Baroni, P., Toni, F.: Argumentative XAI: a survey. In: IJCAI, pp. 4392\u20134399 (2021)","DOI":"10.24963\/ijcai.2021\/600"},{"key":"8_CR6","unstructured":"Cocarascu, O., Stylianou, A., Cyras, K., Toni, F.: Data-empowered argumentation for dialectically explainable predictions. In: ECAI, pp. 2449\u20132456 (2020)"},{"key":"8_CR7","unstructured":"Cocarascu, O., Toni, F.: Argumentation for machine learning: a survey. In: COMMA, pp. 219\u2013230 (2016)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-59286-5_53","volume-title":"Machine Learning: ECML-95","author":"Y Dimopoulos","year":"1995","unstructured":"Dimopoulos, Y., Kakas, A.: Learning non-monotonic logic programs: learning exceptions. In: Lavrac, N., Wrobel, S. (eds.) ECML 1995. LNCS, vol. 912, pp. 122\u2013137. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59286-5_53"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Dung, P.M., Kowalski, R.A., Toni, F.: Assumption-based argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 199\u2013218. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0_10","DOI":"10.1007\/978-0-387-98197-0_10"},{"issue":"2","key":"8_CR10","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\u2013358 (1995)","journal-title":"Artif. Intell."},{"key":"8_CR11","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP, pp. 1070\u20131080. MIT Press (1988)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Inoue, K., Haneda, H.: Learning abductive and nonmonotonic logic programs. In: Abduction and Induction: Essays on their Relation and Integration, pp. 213\u2013231. Kluwer Academic (2000)","DOI":"10.1007\/978-94-017-0606-3_14"},{"key":"8_CR13","unstructured":"Inoue, K., Kudoh, Y.: Learning extended logic programs. In: IJCAI, pp. 176\u2013181. Morgan Kaufmann (1997)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-11558-0_22","volume-title":"Logics in Artificial Intelligence","author":"M Law","year":"2014","unstructured":"Law, M., Russo, A., Broda, K.: Inductive learning of answer set programs. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 311\u2013325. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_22"},{"issue":"3\u20134","key":"8_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse entailment and Progol. N. Gener. Comput. 13(3\u20134), 245\u2013286 (1995)","journal-title":"N. Gener. Comput."},{"issue":"20","key":"8_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A Pettorossi","year":"1994","unstructured":"Pettorossi, A., Proietti, M.: Transformation of logic programs: foundations and techniques. J. Log. Program. 19(20), 261\u2013320 (1994)","journal-title":"J. Log. Program."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.jal.2008.10.007","volume":"7","author":"O Ray","year":"2009","unstructured":"Ray, O.: Nonmonotonic abductive inductive learning. J. Appl. Log. 7(3), 329\u2013340 (2009)","journal-title":"J. Appl. Log."},{"key":"8_CR18","unstructured":"Reiter, R., Criscuolo, G.: On interacting defaults. In: IJCAI, pp. 270\u2013276. William Kaufmann (1981)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-44960-4_13","volume-title":"Inductive Logic Programming","author":"C Sakama","year":"2000","unstructured":"Sakama, C.: Inverse entailment in nonmonotonic logic programs. In: Cussens, J., Frisch, A. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 209\u2013224. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44960-4_13"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/1055686.1055687","volume":"6","author":"C Sakama","year":"2005","unstructured":"Sakama, C.: Induction from answer sets in nonmonotonic logic programs. ACM Trans. Comput. Log. 6(2), 203\u2013231 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H Seki","year":"1991","unstructured":"Seki, H.: Unfold\/fold transformation of stratified programs. Theoret. Comput. Sci. 86, 107\u2013139 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-009-5113-y","volume":"76","author":"C Sakama","year":"2009","unstructured":"Sakama, C., Inoue, K.: Brave induction: a logical framework for learning from incomplete information. Mach. Learn. 76(1), 3\u201335 (2009)","journal-title":"Mach. Learn."},{"issue":"5\u20136","key":"8_CR23","first-page":"1010","volume":"17","author":"F Shakerin","year":"2017","unstructured":"Shakerin, F., Salazar, E., Gupta, G.: A new algorithm to automate inductive learning of default theories. TPLP 17(5\u20136), 1010\u20131026 (2017)","journal-title":"TPLP"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-60939-3_5","volume-title":"Logic Program Synthesis and Transformation","author":"F Toni","year":"1996","unstructured":"Toni, F., Kowalski, R.A.: An argumentation-theoretic approach to logic program transformation. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 61\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60939-3_5"},{"issue":"1","key":"8_CR25","first-page":"89","volume":"5","author":"F Toni","year":"2014","unstructured":"Toni, F.: A tutorial on assumption-based argumentation. Arg. Comput. 5(1), 89\u2013117 (2014)","journal-title":"Arg. Comput."}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55630-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:52:11Z","timestamp":1710831131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55630-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556296","9783031556302"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55630-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Windsor Great Park","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijclr22.doc.ic.ac.uk\/ilp2022.html\/index.html","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":"26","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":"11","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":"42% - 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":"3","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":"2","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)"}}]}}