Logic Program Synthesis from Incomplete Information
Autor Pierre Fleneren Limba Engleză Paperback – 26 sep 2012
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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 948.26 lei 6-8 săpt. | |
| Springer – 26 sep 2012 | 948.26 lei 6-8 săpt. | |
| Hardback (1) | 953.40 lei 6-8 săpt. | |
| Springer Us – 31 dec 1994 | 953.40 lei 6-8 săpt. |
Preț: 948.26 lei
Preț vechi: 1185.32 lei
-20%
Puncte Express: 1422
Preț estimativ în valută:
167.82€ • 196.13$ • 145.70£
167.82€ • 196.13$ • 145.70£
Carte tipărită la comandă
Livrare economică 19 februarie-05 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461359258
ISBN-10: 1461359252
Pagini: 264
Ilustrații: XVIII, 242 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:Softcover reprint of the original 1st ed. 1995
Editura: Springer
Locul publicării:New York, NY, United States
ISBN-10: 1461359252
Pagini: 264
Ilustrații: XVIII, 242 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:Softcover reprint of the original 1st ed. 1995
Editura: Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
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.