Combining analytical and evolutionary inductive programming

Analytical inductive programming and evolutionary in-ductive programming are two opposing strategies for learning recursive programs from incomplete specifica-tions such as input/output examples. Analytical induc-tive programming is data-driven, namely, the minimal recursive generalization over the positive input/output examples is generated by recurrence detection. Evolu-tionary inductive programming, on the other hand, is based on searching through hypothesis space for a (re-cursive) program which performs sufficiently well on the given input/output examples with respect to some measure of fitness. While analytical approaches are fast and guarantee some characteristics of the induced pro-gram by construction (such as minimality and termi-nation) the class of inducable programs is restricted to problems which can be specified by few positive exam-ples. The scope of programs which can be generated by evolutionary approaches is, in principle, unrestricted, but generation times are typically high and there is no guarantee that such a program is found for which the fitness is optimal. We present a first study exploring possible benefits from combining analytical and evolu-tionary inductive programming. We use the analytical system Igor2 to generate skeleton programs which are used as initial hypotheses for the evolutionary system Adate. We can show that providing such constraints can reduce the induction time of Adate