Inductive Synthesis of Recursive Functional Programs
One of the most challenging subfields, and a still little researched niche of machine learning, is the inductive synthesis of recursive programs from incomplete specifications, such as examples for the desired input/output behavior [1,2,3,4].
Unable to display preview. Download preview PDF.
- 4.Kitzelmann, E., Schmid, U.: Inductive synthesis of functional programs: An explanation based generalization approach. Journal of Machine Learning Research 7(February), 429–454 (2006)Google Scholar
- 7.D. Malerba, A. Varalro, M.B.: Learning recursive theories with the separate-and-parallel conquer strategy. In: Proceedings of the Workshop on Advances in Inductive Rule Learning in conjunction with ECML/PKDD, pp. 179–193 (2004)Google Scholar
- 8.Flener, P.: Inductive logic program synthesis with Dialogs. In: Muggleton, S. (ed.) Proceedings of the 6th International Workshop on Inductive Logic Programming, pp. 28–51. Stockholm University, Royal Institute of Technology (1996)Google Scholar
- 9.Muggleton, S., Feng, C.: Efficient induction of logic programs. In: Proceedings of the 1st Conference on Algorithmic Learning Theory, pp. 368–381. Ohmsma, Tokyo, Japan (1990)Google Scholar