A Strong Complete Schema for Inductive Functional Logic Programming [chapter]

J. Hernández-Orallo, M. J. Ramírez-Quintana
1999 Lecture Notes in Computer Science  
A new IFLP schema is presented as a general framework for the induction of functional logic programs (FLP). Since narrowing (which is the most usual operational semantics of FLP) performs a unification (mgu) followed by a replacement, we introduce two main operators in our IFLP schema: a generalisation and an inverse replacement or intrareplacement, which results in a generic inversion of the transitive property of equality. We prove that this schema is strong complete in the way that, given
more » ... e evidence, it is possible to induce any program which could have generated that evidence. We outline some possible restrictions in order to improve the tractability of the schema. We also show that inverse narrowing is just a special case of our IFLP schema. Finally, a straightforward extension of the IFLP schema to function invention is illustrated.
doi:10.1007/3-540-48751-4_12 fatcat:sgm6yfwfive4jcw6ngv42fxzf4