Exploring the Effectiveness of Using Promising Subprograms in Program Synthesis with Budgeted Search
A. Jelev (TU Delft - Aerospace Engineering)
S. Dumančić – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
J.G.H. Cockx – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Program synthesis is a computationally difficult task. Budgeted search seems to be a relatively unexplored method of performing program synthesis tasks. This paper describes a budgeted program synthesis implementation that makes use of subprograms it discovers during attempts and leverages them in future attempts in hopes of finding an optimal solution faster. The approach performed slightly worse than most of the control synthesis task runs during experiments. However, some specific cases were discovered for which the budgeted synthesis ran faster than the control synthesis task.