Skip to main content
SpringerLink
Log in
Book cover

Inductive Synthesis of Functional Programs

Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning

  • Book
  • © 2003

Overview

Authors:
  1. Ute Schmid

    1. Institute of Computer Science Department of Mathematics and Computer Science, University of Osnabrück, Osnabrück, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2654)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Download chapter PDF

  2. 1. Introduction

    1. 1. Introduction

      • Ute Schmid
      Pages 1-10

  3. Part I. Planning

    1. Front Matter

      Pages 11-11
      Download chapter PDF

    2. 2. State-Based Planning

      • Ute Schmid
      Pages 13-54

    3. 3. Constructing Complete Sets of Optimal Plans

      • Ute Schmid
      Pages 55-70

    4. 4. Integrating Function Application in State-Based Planning

      • Ute Schmid
      Pages 71-91

    5. 5. Conclusions and Further Research

      • Ute Schmid
      Pages 93-96

  4. Part II. Inductive Program Synthesis

    1. Front Matter

      Pages 97-97
      Download chapter PDF

    2. 6. Automatic Programming

      • Ute Schmid
      Pages 99-166

    3. 7. Folding of Finite Program Terms

      • Ute Schmid
      Pages 167-225

    4. 8. Transforming Plans into Finite Programs

      • Ute Schmid
      Pages 227-269

    5. 9. Conclusions and Further Research

      • Ute Schmid
      Pages 271-275

  5. Part III. Schema Abstraction

    1. Front Matter

      Pages 277-277
      Download chapter PDF

    2. 10. Analogical Reasoning and Generalization

      • Ute Schmid
      Pages 279-290

    3. 11. Structural Similarity in Analogical Transfer

      • Ute Schmid
      Pages 291-310

    4. 12. Programming by Analogy

      • Ute Schmid
      Pages 311-321

    5. 13. Conclusions and Further Research

      • Ute Schmid
      Pages 323-325

  6. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Institute of Computer Science Department of Mathematics and Computer Science, University of Osnabrück, Osnabrück, Germany

    Ute Schmid

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation