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

Instant online reading.
Don't wait for delivery!

Inductive Synthesis of Functional Programs

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

By: Ute Schmid

Write A Review

Paperback | 21 August 2003

At a Glance

Paperback
424 Pages

Dimensions(cm)
23.5 x 15.24 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

Introduction	p. 1
Planning
State-Based Planning	p. 13
Constructing Complete Sets of Optimal Plans	p. 55
Integrating Function Application in Planning	p. 71
Conclusions and Further Research	p. 93
Inductive Program Synthesis
Automatic Programming	p. 99
Folding of Finite Program Terms	p. 167
Transforming Plans into Finite Programs	p. 227
Conclusions and Further Research	p. 271
Schema Abstraction
Analogical Reasoning and Generalization	p. 279
Structural Similarity in Analogical Transfer	p. 291
Programming by Analogy	p. 311
Conclusions and Further Research	p. 323
Bibliography	p. 327
Implementation Details	p. 343
Concepts and Proofs	p. 357
Sample Programs and Problems	p. 369
Index	p. 391
Table of Contents provided by Blackwell. All Rights Reserved.

Inductive Synthesis of Functional Programs

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

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Mathematical Foundations of Blockchains

Engineering Principles, Volume 2

AI Engineering

Building Applications with Foundation Models

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Effective Machine Learning Teams

Best Practices for ML Practitioners

Mathematical Foundations of Blockchains

Fundamentals, Volume 1

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

AI for Decision Intelligence in Critical Systems

Advances in Applied Mathematics

AI for Decision Intelligence in Critical Systems

Advances in Applied Mathematics

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Nonlinear Analysis for Human Movement Variability

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

Theory of Computation for Software Developers

Theory of Computation for Software Developers

Introduction to Modern Cryptography

Revised Third Edition

Zhang Time Discretization (ZTD) Formulas and Applications

AI and Blockchain in Smart Grids

Fundamentals, Methods, and Applications

Attack-and-Defense Games for Control Systems

Analysis and Synthesis

Why Don't Rabbits Rule The World?

Mathematical answers to life's key questions

Surveys in Combinatorics 2026

London Mathematical Society Lecture Note Series

Applied Mathematics with F#

This product is categorised by