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

Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and…

byUte Schmid

Paperback | August 21, 2003

Pricing and Purchase Info

$125.55 online 
$150.50 list price save 16%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.

Title:Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and…Format:PaperbackDimensions:402 pages, 23.3 × 15.5 × 0.01 inPublished:August 21, 2003Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540401741

ISBN - 13:9783540401742

Look for similar items by category:

Reviews

Table of Contents

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.