{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T12:49:59Z","timestamp":1775825399869,"version":"3.50.1"},"reference-count":41,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T00:00:00Z","timestamp":1644364800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The goal of inductive logic programming (ILP) is to learn a program that explains a set of examples. Until recently, most research on ILP targeted learning Prolog programs. The ILASP system instead learns answer set programs (ASP). Learning such expressive programs widens the applicability of ILP considerably; for example, enabling preference learning, learning common-sense knowledge, including defaults and exceptions, and learning non-deterministic theories. Early versions of ILASP can be considered meta-level ILP approaches, which encode a learning task as a logic program and delegate the search to an ASP solver. More recently, ILASP has shifted towards a new method, inspired by conflict-driven SAT and ASP solvers. The fundamental idea of the approach, called Conflict-driven ILP (CDILP), is to iteratively interleave the search for a hypothesis with the generation of constraints which explain why the current hypothesis does not cover a particular example. These coverage constraints allow ILASP to rule out not just the current hypothesis, but an entire class of hypotheses that do not satisfy the coverage constraint. This article formalises the CDILP approach and presents the ILASP3 and ILASP4 systems for CDILP, which are demonstrated to be more scalable than previous ILASP systems, particularly in the presence of noise.<\/jats:p>","DOI":"10.1017\/s1471068422000011","type":"journal-article","created":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T09:02:09Z","timestamp":1644397329000},"page":"387-414","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":10,"title":["Conflict-Driven Inductive Logic Programming"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4554-3415","authenticated-orcid":false,"given":"MARK","family":"LAW","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,2,9]]},"reference":[{"key":"S1471068422000011_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037227"},{"key":"S1471068422000011_ref6","unstructured":"Corapi, D. , Russo, A. , and Lupu, E. 2010. Inductive logic programming as abductive search. In Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010, July 16-19, 2010, Edinburgh, Scotland, UK. LIPIcs, vol. 7. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 54\u201363."},{"key":"S1471068422000011_ref37","doi-asserted-by":"crossref","unstructured":"Sakama, C. 2000. Inverse entailment in nonmonotonic logic programs. In Inductive Logic Programming, 10th International Conference, ILP 2000, London, UK, July 24-27, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1866. Springer, 209\u2013224.","DOI":"10.1007\/3-540-44960-4_13"},{"key":"S1471068422000011_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037089"},{"key":"S1471068422000011_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-020-05934-z"},{"key":"S1471068422000011_ref4","doi-asserted-by":"crossref","unstructured":"Bragaglia, S. and Ray, O. 2014. Nonmonotonic learning in large biological networks. In Inductive Logic Programming - 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers. Lecture Notes in Computer Science, vol. 9046. Springer, 33\u201348.","DOI":"10.1007\/978-3-319-23708-4_3"},{"key":"S1471068422000011_ref16","unstructured":"Inoue, K. and Kudoh, Y. 1997. Learning extended logic programs. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, 2 Volumes. Morgan Kaufmann, 176\u2013181."},{"key":"S1471068422000011_ref13","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-2011-0491"},{"key":"S1471068422000011_ref21","doi-asserted-by":"crossref","unstructured":"Law, M. , Russo, A. , Bertino, E. , Broda, K. , and Lobo, J. 2019. Representing and learning grammars in answer set programming. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27\u2013February 1, 2019. AAAI Press, 2919\u20132928.","DOI":"10.1609\/aaai.v33i01.33012919"},{"key":"S1471068422000011_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000198"},{"key":"S1471068422000011_ref40","unstructured":"Srinivasan, A. 2001. The aleph manual. https:\/\/www.cs.ox.ac.uk\/activities\/programinduction\/Aleph\/aleph.html. [Accessed on January 29, 2022]."},{"key":"S1471068422000011_ref41","unstructured":"Wrobel, S. 1996. First order theory refinement. Advances in inductive logic programming 32, 14\u201333."},{"key":"S1471068422000011_ref36","doi-asserted-by":"crossref","unstructured":"Ray, O. , Broda, K. , and Russo, A. 2003. Hybrid abductive inductive learning: A generalisation of progol. In Inductive Logic Programming: 13th International Conference, ILP 2003, Szeged, Hungary, September 29-October 1, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2835. Springer, 311\u2013328.","DOI":"10.1007\/978-3-540-39917-9_21"},{"key":"S1471068422000011_ref39","doi-asserted-by":"publisher","DOI":"10.1109\/5254.889105"},{"key":"S1471068422000011_ref30","doi-asserted-by":"crossref","unstructured":"Lynce, I. and Marques-Silva, J. 2003. The effect of nogood recording in DPLL-CBJ SAT algorithms. In Recent Advances in Constraints. Springer, 144\u2013158.","DOI":"10.1007\/3-540-36607-5_11"},{"key":"S1471068422000011_ref23","doi-asserted-by":"crossref","unstructured":"Law, M. , Russo, A. , and Broda, K. 2014. Inductive learning of answer set programs. In Logics in Artificial Intelligence \u2013 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8761. Springer, 311\u2013325.","DOI":"10.1007\/978-3-319-11558-0_22"},{"key":"S1471068422000011_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2008.10.007"},{"key":"S1471068422000011_ref33","doi-asserted-by":"crossref","unstructured":"Oblak, A. and Bratko, I. 2010. Learning from noisy data using a non-covering ILP algorithm. In Inductive Logic Programming - 20th International Conference, ILP 2010, Florence, Italy, June 27-30, 2010. Revised Papers. Lecture Notes in Computer Science, vol. 6489. Springer, 190\u2013197.","DOI":"10.1007\/978-3-642-21295-6_22"},{"key":"S1471068422000011_ref29","doi-asserted-by":"crossref","unstructured":"Law, M. , Russo, A. , Broda, K. , and Bertino, E. 2021. Scalable non-observational predicate learning in ASP. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event Montreal, Canada, 19-27 August 2021. 1936\u20131943.","DOI":"10.24963\/ijcai.2021\/267"},{"key":"S1471068422000011_ref7","doi-asserted-by":"crossref","unstructured":"Corapi, D. , Russo, A. , and Lupu, E. 2011. Inductive logic programming in answer set programming. In Inductive Logic Programming - 21st International Conference, ILP 2011, Windsor Great Park, UK, July 31 - August 3, 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol. 7207. Springer, 91\u201397.","DOI":"10.1007\/978-3-642-31951-8_12"},{"key":"S1471068422000011_ref11","doi-asserted-by":"crossref","unstructured":"Furelos-Blanco, D. , Law, M. , Jonsson, A. , Broda, K. , and Russo, A. 2021. Induction and exploitation of subgoal automata for reinforcement learning. Journal of Artificial Intelligence Research 70, 1031\u20131116.","DOI":"10.1613\/jair.1.12372"},{"key":"S1471068422000011_ref22","doi-asserted-by":"crossref","unstructured":"Law, M. , Russo, A. , Bertino, E. , Broda, K. , and Lobo, J. 2020. Fastlas: Scalable inductive logic programming incorporating domain-specific optimisation criteria. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7\u201312, 2020. AAAI Press, 2877\u20132885.","DOI":"10.1609\/aaai.v34i03.5678"},{"key":"S1471068422000011_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5512-1"},{"key":"S1471068422000011_ref1","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Dodaro, C. , Faber, W. , Leone, N. , and Ricca, F. 2013. WASP: A native ASP solver based on constraint learning. In Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings. Lecture Notes in Computer Science, vol. 8148. Springer, 54\u201366.","DOI":"10.1007\/978-3-642-40564-8_6"},{"key":"S1471068422000011_ref26","doi-asserted-by":"crossref","unstructured":"Law, M. , Russo, A. , and Broda, K. 2018a. The complexity and generality of learning answer set programs. Artificial Intelligence 259, 110\u2013146.","DOI":"10.1016\/j.artint.2018.03.005"},{"key":"S1471068422000011_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000351"},{"key":"S1471068422000011_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05843-w"},{"key":"S1471068422000011_ref28","unstructured":"Law, M. , Russo, A. , and Broda, K. 2020. The ILASP system for inductive learning of answer set programs. The Association for Logic Programming Newsletter. https:\/\/www.cs.nmsu.edu\/ALP\/2020\/04\/the-ilasp-system-for-inductive-learning-of-answer-set-programs\/. [Accessed on January 29, 2022]."},{"key":"S1471068422000011_ref17","doi-asserted-by":"crossref","unstructured":"Kaminski, T. , Eiter, T. , and Inoue, K. 2019. Meta-interpretive learning using HEX-programs. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019. ijcai.org, 6186\u20136190.","DOI":"10.24963\/ijcai.2019\/860"},{"key":"S1471068422000011_ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5113-y"},{"key":"S1471068422000011_ref2","unstructured":"Athakravi, D. 2015. Inductive logic programming using bounded hypothesis space. Ph.D. thesis, Imperial College London."},{"key":"S1471068422000011_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF00117105"},{"key":"S1471068422000011_ref5","unstructured":"Chabierski, P. , Russo, A. , Law, M. , and Broda, K. 2017. Machine comprehension of text using combinatory categorial grammar and answer set programs. In Proceedings of the Thirteenth International Symposium on Commonsense Reasoning, COMMONSENSE 2017, London, UK, November 6-8, 2017. CEUR Workshop Proceedings, vol. 2052. CEUR-WS."},{"key":"S1471068422000011_ref27","unstructured":"Law, M. , Russo, A. , and Broda, K. 2018b. Inductive learning of answer set programs from noisy examples. Advances in Cognitive Systems 7, 57\u201376."},{"key":"S1471068422000011_ref14","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Ostrowski, M. , Schaub, T. , and Wanko, P. 2016. Theory solving made easy with Clingo 5. In Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA. OASICS, vol. 52. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2:1\u20132:15."},{"key":"S1471068422000011_ref15","unstructured":"Gebser, M. , Kaufmann, B. , Neumann, A. , and Schaub, T. 2007. Conflict-driven answer set solving. In IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007. 386."},{"key":"S1471068422000011_ref12","doi-asserted-by":"crossref","unstructured":"Furelos-Blanco, D. , Law, M. , Russo, A. , Broda, K. , and Jonsson, A. 2020. Induction of subgoal automata for reinforcement learning. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020. AAAI Press, 3890\u20133897.","DOI":"10.1609\/aaai.v34i04.5802"},{"key":"S1471068422000011_ref20","unstructured":"Law, M. 2018. Inductive learning of answer set programs. Ph.D. thesis, Imperial College London."},{"key":"S1471068422000011_ref10","unstructured":"Cropper, A. and Muggleton, S. H. 2016. Metagol system. https:\/\/github.com\/metagol\/metagol. [Accessed on January 29, 2022]."},{"key":"S1471068422000011_ref3","doi-asserted-by":"crossref","unstructured":"Athakravi, D. , Corapi, D. , Broda, K. , and Russo, A. 2013. Learning through hypothesis refinement using answer set programming. In Inductive Logic Programming - 23rd International Conference, ILP 2013, Rio de Janeiro, Brazil, August 28-30, 2013, Revised Selected Papers. Lecture Notes in Computer Science, vol. 8812. Springer, 31\u201346.","DOI":"10.1007\/978-3-662-44923-3_3"},{"key":"S1471068422000011_ref19","doi-asserted-by":"crossref","unstructured":"Kazmi, M. , Sch\u00fcller, P. , and Saygn, Y. 2017. Improving scalability of inductive logic programming via pruning and best-effort optimisation. Expert Systems with Applications 87, 291\u2013303.","DOI":"10.1016\/j.eswa.2017.06.013"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068422000011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T23:38:24Z","timestamp":1680478704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000011\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,9]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["S1471068422000011"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000011","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}