Bottom-up induction of logic programs with more than one recursive clause

In this paper we present a bottom-up algorithm called MRI to induce logic programs from their examples. This method can induce programs with a base clause and more than one recursive clause from a very small number of examples. MRI is based on the analysis of saturations of examples. It rst generates a path structure, which is an expression of a stream of values processed by predicates. The concept of path structure was originally introduced by Identam-Almquist and used in TIM [ IdestamAlmquist, 1996 ] . In this paper, we introduce the concepts of extension and di erence of path structure. Recursive clauses can be expressed as a di erence between a path structure and its extension. The paper presents the algorithm and shows experimental results obtained by the method.