Inductive synthesis of recursive logic programs: achievements and prospects

AbstractThe inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of Inductive Logic Programming (ILP) and of the synthesis (in general) of logic programs, from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis of recursive logic programs but also discussing a few general ILP techniques that can also induce non-recursive hypotheses. Then we analyse the prospects of these techniques in this task, investigating their applicability to software engineering as well as to knowledge acquisition and discovery