Logic Program Synthesis from Incomplete Information / Edition 1

Logic Program Synthesis from Incomplete Information / Edition 1

by Pierre Flener
ISBN-10:
0792395328
ISBN-13:
9780792395324
Pub. Date:
12/31/1994
Publisher:
Springer US
ISBN-10:
0792395328
ISBN-13:
9780792395324
Pub. Date:
12/31/1994
Publisher:
Springer US
Logic Program Synthesis from Incomplete Information / Edition 1

Logic Program Synthesis from Incomplete Information / Edition 1

by Pierre Flener

Hardcover

$169.99
Current price is , Original price is $169.99. You
$169.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

Program synthesis is a solution to the software crisis. If we had a program that develops correct programs from specifications, then program validation and maintenance would disappear from the software life-cycle, and one could focus on the more creative tasks of specification elaboration, validation, and maintenance, because replay of program development would be less costly.
This monograph describes a novel approach to Inductive Logic Programming (ILP), which cross-fertilizes logic programming and machine learning. Aiming at the synthesis of recursive logic programs only, and this from incomplete information, we take a software engineering approach that is more appropriate than a pure artificial intelligence approach.
This book is suitable as a secondary text for graduate level courses in software engineering and artificial intelligence, and as a reference for practitioners of program synthesis.

Product Details

ISBN-13: 9780792395324
Publisher: Springer US
Publication date: 12/31/1994
Series: The Springer International Series in Engineering and Computer Science , #295
Edition description: 1995
Pages: 242
Product dimensions: 6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

I State of the Art.- 1 Automatic Programming.- 2 Deductive Inference in Automatic Programming.- 3 Inductive Inference in Automatic Programming.- 4 A Logic Program Development Methodology.- 5 Objectives.- II Building Blocks.- 6 A Specification Approach.- 7 A Framework for Stepwise Logic Algorithm Synthesis.- 8 Algorithm Analysis and Algorithm Schemata.- 9 The Proofs-as-Programs Method.- 10 The Most-Specific-Generalization Method.- III A Logic Algorithm Synthesis Mechanism.- 11 Overview of the Synthesis Mechanism.- 12 The Expansion Phase.- 13 The Reduction Phase.- 14 Conclusion.- Appendix: Conventions, Abbreviations, and Symbols.- References.
From the B&N Reads Blog

Customer Reviews