Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning (Lecture Notes in Computer Science, 2654)

Schmid, Ute

ISBN 10: 3540401741 / ISBN 13: 9783540401742

Editore: Springer, 2003

Riguardo questo articolo

In.

Codice articolo ria9783540401742_new

Dati bibliografici

• Titolo: Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning (Lecture Notes in Computer Science, 2654)
• Editore: Springer
• Data di pubblicazione: 2003
• Lingua: Inglese
• ISBN 10: 3540401741
• ISBN 13: 9783540401742
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

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.

Contenuti

1. Introduction.- 1. Introduction.- I. Planning.- 2. State-Based Planning.- 3. Constructing Complete Sets of Optimal Plans.- 4. Integrating Function Application in State-Based Planning.- 5. Conclusions and Further Research.- II. Inductive Program Synthesis.- 6. Automatic Programming.- 7. Folding of Finite Program Terms.- 8. Transforming Plans into Finite Programs.- 9. Conclusions and Further Research.- III. Schema Abstraction.- 10. Analogical Reasoning and Generalization.- 11. Structural Similarity in Analogical Transfer.- 12. Programming by Analogy.- 13. Conclusions and Further Research.