Overview
- Includes supplementary material: sn.pub/extras
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)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (13 chapters)
-
1. Introduction
-
Part II. Inductive Program Synthesis
-
Part III. Schema Abstraction
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
Bibliographic Information
Book Title: Inductive Synthesis of Functional Programs
Book Subtitle: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning
Authors: Ute Schmid
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b12055
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2003
Softcover ISBN: 978-3-540-40174-2Published: 21 August 2003
eBook ISBN: 978-3-540-44846-4Published: 09 September 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XXII, 402
Topics: Artificial Intelligence, Science, Humanities and Social Sciences, multidisciplinary, Programming Techniques, Software Engineering, Logics and Meanings of Programs, Mathematical Logic and Formal Languages