In plain words: Inductive logic programming learns a set of logical rules that fit training examples and work on new ones. This 30-year overview explains the basics, compares several rule-learning systems, and maps out where the field works well and what still holds it back.
Abstract
Inductive logic programming (ILP) is a form of machine learning. The goal of ILP is to induce a hypothesis (a set of logical rules) that generalises training examples. As ILP turns 30, we provide a new introduction to the field. We introduce the necessary logical notation and the main learning settings; describe the building blocks of an ILP system; compare several systems on several dimensions; describe four systems (Aleph, TILDE, ASPAL, and Metagol); highlight key application areas; and, finally, summarise current limitations and directions for future research.
Andrew Cropper, Sebastijan Dumančić
arXiv:2008.07912 · cs.AI, cs.LG · submitted Aug 18, 2020 · updated Mar 22, 2022
abstract · pdf · html · Preprint of a paper accepted for JAIR