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

Format:

Book

Author/Creator:

Schmid, U. (Ute), author.

Contributor:

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science. Lecture notes in artificial intelligence ; 2654.

Lecture Notes in Artificial Intelligence ; 2654

Language:

English

Subjects (All):

Artificial intelligence.

Computer programming.

Software engineering.

Computer logic.

Logic, Symbolic and mathematical.

Artificial Intelligence.

Science, Humanities and Social Sciences, multidisciplinary.

Programming Techniques.

Software Engineering.

Logics and Meanings of Programs.

Mathematical Logic and Formal Languages.

Local Subjects:

Artificial Intelligence.

Science, Humanities and Social Sciences, multidisciplinary.

Programming Techniques.

Software Engineering.

Logics and Meanings of Programs.

Mathematical Logic and Formal Languages.

Physical Description:

1 online resource (XXII, 402 pages).

Edition:

First edition 2003.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.

System Details:

text file PDF

Summary:

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.

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.

Other Format:

Printed edition:

ISBN:

978-3-540-44846-4

9783540448464

Access Restriction:

Restricted for use by site license.