{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:26:55Z","timestamp":1775266015347,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030038397","type":"print"},{"value":"9783030038403","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03840-3_21","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T01:28:57Z","timestamp":1541640537000},"page":"279-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring Abstract Argumentation-Based Approaches to Tackle Inconsistent Observations in Inductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Pazienza","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Ferilli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"21_CR1","unstructured":"Ali, K.M., Pazzani, M.J.: HYDRA: a noise-tolerant relational concept learning algorithm. In: IJCAI, pp. 1064\u20131071 (1993)"},{"key":"21_CR2","volume-title":"Handbook of Formal Argumentation","author":"P Baroni","year":"2018","unstructured":"Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L.: Handbook of Formal Argumentation, vol. 1. College Publications, Joplin (2018)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11518655_33","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"C Cayrol","year":"2005","unstructured":"Cayrol, C., Lagasquie-Schiex, M.C.: On the acceptability of arguments in bipolar argumentation frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 378\u2013389. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11518655_33"},{"key":"21_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S Ceri","year":"1990","unstructured":"Ceri, S., Gottl\u00f6b, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/978-3-642-83952-8"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/jigpal\/4.2.227","volume":"4","author":"L Raedt De","year":"1996","unstructured":"De Raedt, L., Lavra\u010d, N.: Multiple predicate learning in two inductive logic programming settings. Log. J. IGPL 4(2), 227\u2013254 (1996)","journal-title":"Log. J. IGPL"},{"issue":"2","key":"21_CR6","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."},{"key":"21_CR7","unstructured":"D\u017eeroski, S.: Handling imperfect data in inductive logic programming. In: Proceedings of the Fourth Scandinavian Conference on Artificial Intelligence\u201393, SCAI93, pp. 111\u2013125 (1993)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/978-3-540-89982-2_67","volume-title":"Logic Programming","author":"U Egly","year":"2008","unstructured":"Egly, U., Gaggl, S.A., Woltran, S.: ASPARTIX: implementing argumentation frameworks using answer-set programming. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 734\u2013738. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_67"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5714","volume":"61","author":"R Evans","year":"2018","unstructured":"Evans, R., Grefenstette, E.: Learning explanatory rules from noisy data. J. Artif. Intell. Res. 61, 1\u201364 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10844-018-0531-6","volume":"51","author":"Stefano Ferilli","year":"2018","unstructured":"Ferilli, S.: Extending expressivity and flexibility of abductive logic programming. J. Intell. Inf. Syst. (2018). https:\/\/doi.org\/10.1007\/s10844-018-0531-6 , ISSN: 1573-7675","journal-title":"Journal of Intelligent Information Systems"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-61863-5_47","volume-title":"Algorithmic Learning Theory","author":"D Gamberger","year":"1996","unstructured":"Gamberger, D., Lavra\u010d, N., D\u017eeroski, S.: Noise elimination in inductive concept learning: a case study in medical diagnosis. In: Arikawa, S., Sharma, A.K. (eds.) ALT 1996. LNCS, vol. 1160, pp. 199\u2013212. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61863-5_47"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0017020","volume-title":"Machine Learning \u2014 EWSL-91","author":"N Lavra\u010d","year":"1991","unstructured":"Lavra\u010d, N., D\u017eeroski, S., Grobelnik, M.: Learning nonrecursive definitions of relations with linus. In: Kodratoff, Y. (ed.) EWSL 1991. LNCS, vol. 482, pp. 265\u2013281. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017020"},{"key":"21_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987). https:\/\/doi.org\/10.1007\/978-3-642-83189-8","edition":"2"},{"key":"21_CR14","unstructured":"McCreath, E., Sharma, A.: ILP with noise and fixed example size: a Bayesian approach. In: IJCAI, vol. 97, pp. 1310\u20131315 (1997)"},{"key":"21_CR15","unstructured":"Muggleton, S., Feng, C.: Efficient induction of logic programs. In: New Generation Computing. Academic Press (1990)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1023\/A:1022699322624","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Mach.learn. 5(3), 239\u2013266 (1990)","journal-title":"Mach.learn."},{"key":"21_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0","volume-title":"Argumentation in Artificial Intelligence","author":"I Rahwan","year":"2009","unstructured":"Rahwan, I., Simari, G.R., van Benthem, J.: Argumentation in Artificial Intelligence, vol. 47. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0"},{"issue":"2","key":"21_CR18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022611224557","volume":"19","author":"BL Richards","year":"1995","unstructured":"Richards, B.L., Mooney, R.J.: Automated refinement of first-order horn-clause domain theories. Mach. Learn. 19(2), 95\u2013131 (1995)","journal-title":"Mach. Learn."},{"key":"21_CR19","unstructured":"Rotella, F., Ferilli, S.: Probabilistic abductive logic programming using possible worlds. In: Proceedings of the 28th Italian Convention on Computational Logic (CILC-2013), Central Europe (CEUR) Workshop Proceedings, vol. 1068, pp. 131\u2013145 (2013)"},{"key":"21_CR20","unstructured":"Rouveirol, C.: Extensions of inversion of resolution applied to theory completion. In: Inductive Logic Programming, pp. 64\u201390. Academic Press (1992)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-49674-2_16","volume-title":"Logic Program Synthesis and Transformation","author":"G Semeraro","year":"1998","unstructured":"Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incremental inductive synthesis of datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 300\u2013321. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49674-2_16"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2018 \u2013 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03840-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:22:40Z","timestamp":1775262160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03840-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038397","9783030038403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03840-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","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":"aiia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aixia2018.fbk.eu\/index.php\/home\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20% - 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"}},{"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"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}