Abstract
We demonstrated that planning can be combined with inductive program synthesis by first generating a universal plan for a problem with a small number of objects, then transforming this plan into a finite program term, and folding this term into a recursive program scheme. While planning and folding can be performed by powerful, domain-independent algorithms, plan transformation is knowledge dependent. In part I, we presented the domain-independent universal planner DPlan. In this part, we presented an approach to folding finite program terms based on pattern-matching which is more powerful than other published approaches.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmid, U. (2003). 9. Conclusions and Further Research. In: Inductive Synthesis of Functional Programs. Lecture Notes in Computer Science(), vol 2654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44846-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-44846-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40174-2
Online ISBN: 978-3-540-44846-4
eBook Packages: Springer Book Archive