Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical ReasoningBecause 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
Introduction | 1 |
StateBased Planning 13 | 12 |
Constructing Complete Sets of Optimal Plans | 55 |
Integrating Function Application in Planning | 71 |
Conclusions and Further Research | 93 |
Folding of Finite Program Terms | 167 |
Transforming Plans into Finite Programs | 227 |
Conclusions and Further Research 271 | 270 |
Analogical Reasoning and Generalization 279 | 277 |
Other editions - View all
Inductive Synthesis of Functional Programs: Universal Planning, Folding of ... Ute Schmid Limited preview - 2003 |
Inductive Synthesis of Functional Programs: Universal Planning, Folding of ... Ute Schmid No preview available - 2003 |
Inductive Synthesis of Functional Programs: Universal Planning, Folding of ... Ute Schmid No preview available - 2014 |
Common terms and phrases
abstract actions algorithm analogy application approach block body calculating called chap chapter clauses clear complete constraints constructed contains corresponds defined Definition defun described discussed domain DPlan effects efficient element equal equation example exists extended figure finite program folding function give given goal holds hypothesis inductive inference initial trees input instantiations introduced ISC P1 knowledge language learning literals logic mapping node objects operator optimal pairs parameters pattern performed points position possible predicate presented problem problem solving program synthesis proof PUTTABLE reasoning recursive relation representation represented restricted returns rules scheme sect segments sequence similarity solution sorting specification step structure subprogram substitution symbols term theorem Tinit tion tower traces transfer transformation unfolding universal plan variables