A Scheme-Driven Approach to Learning Programs from Input/Output Equations
This addresses program synthesis for researchers in automated reasoning or functional programming, but it is incremental as it builds on existing structurally recursive methods.
The paper tackles the problem of learning function definitions from input/output equations in a term-rewriting setting, resulting in a fast algorithm that often produces definitions close to intuitive expectations.
We describe an approach to learn, in a term-rewriting setting, function definitions from input/output equations. By confining ourselves to structurally recursive definitions we obtain a fairly fast learning algorithm that often yields definitions close to intuitive expectations. We provide a Prolog prototype implementation of our approach, and indicate open issues of further investigation.