Abstract
Now we are ready to combine universal planning as described in chapter 3 and induction of recursive program schemes as described in chapter 7. In this chapter, we introduce an approach to transform plans generated by universal planning into finite programs which are used as input to our folder. On the one hand, we present an alternative approach to realizing the first step of inductive program synthesis as described in section 6.3.4 in chapter 6 - using AI planning as basis for generating program traces.
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). 8. Transforming Plans into Finite Programs. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-44846-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40174-2
Online ISBN: 978-3-540-44846-4
eBook Packages: Springer Book Archive