Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 2654 : Lecture Notes in Artificial Intelligence

ISBN: 3540401741, 9783540401742

Size: 1 MB (1549457 bytes)

Pages: 402/365

File format:

Language:

Publishing Year:

Category: Tags: , , , ,

Ute Schmid (auth.)3540401741, 9783540401742

Because of its promise to support human programmers in developing correct and efficient program code and in reasoning about programs, automatic program synthesis has attracted the attention of researchers and professionals since the 1970s.

This book focusses on inductive program synthesis, and especially on the induction of recursive functions; it is organized into three parts on planning, inductive program synthesis, and analogical problem solving and learning. Besides methodological issues in inductive program synthesis, emphasis is placed on its applications to control rule learning for planning. Furthermore, relations to problem solving and learning in cognitive psychology are discussed.


Table of contents :
Front Matter….Pages –
1. Introduction….Pages 1-10
Front Matter….Pages 11-11
2. State-Based Planning….Pages 13-54
3. Constructing Complete Sets of Optimal Plans….Pages 55-70
4. Integrating Function Application in State-Based Planning….Pages 71-91
5. Conclusions and Further Research….Pages 93-96
Front Matter….Pages 97-97
6. Automatic Programming….Pages 99-166
7. Folding of Finite Program Terms….Pages 167-225
8. Transforming Plans into Finite Programs….Pages 227-269
9. Conclusions and Further Research….Pages 271-275
Front Matter….Pages 277-277
10. Analogical Reasoning and Generalization….Pages 279-290
11. Structural Similarity in Analogical Transfer….Pages 291-310
12. Programming by Analogy….Pages 311-321
13. Conclusions and Further Research….Pages 323-325
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning”
Shopping Cart
Scroll to Top