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

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

by Ute Schmid
ISBN-10:
3540401741
ISBN-13:
9783540401742
Pub. Date:
09/29/2003
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3540401741
ISBN-13:
9783540401742
Pub. Date:
09/29/2003
Publisher:
Springer Berlin Heidelberg
Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning / Edition 1

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

by Ute Schmid

Paperback

$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

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.


Product Details

ISBN-13: 9783540401742
Publisher: Springer Berlin Heidelberg
Publication date: 09/29/2003
Series: Lecture Notes in Computer Science , #2654
Edition description: 2003
Pages: 402
Product dimensions: 6.10(w) x 9.17(h) x 0.36(d)

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.
From the B&N Reads Blog

Customer Reviews