Analogical and Inductive Inference
Editat de Klaus P. Jantkeen Limba Engleză Paperback – 20 sep 1989
Preț: 324.82 lei
Preț vechi: 406.03 lei
-20%
Puncte Express: 487
Carte tipărită la comandă
Livrare economică 23 iunie-07 iulie
Specificații
ISBN-13: 9783540517344
ISBN-10: 3540517340
Pagini: 352
Ilustrații: IX, 338 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540517340
Pagini: 352
Ilustrații: IX, 338 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Inductive inference from good examples.- Inductive inference, DFAs, and computational complexity.- Why and how program synthesis?.- Some thoughts on the role of examples in program transformation and its relevance for explanation-based learning.- Towards representation independence in PAC learning.- Learning context-free languages efficiently.- Learning programs with an easy to calculate set of errors.- Inductive inference up to immune sets.- Refined query inference.- Learning ?-regular languages from queries and counter-examples (a preliminary report).- A refutation of Barzdins' conjecture.- Generalizing multiple examples in explanation based learning.- Nested hyper-rectangles for exemplar-based learning.- Second-order inductive learning.- Modes of analogy.- Some aspects of analogy in mathematical reasoning.- A sketch of analogy as reasoning with equality hypotheses.- Analogical inference as generalised inductive inference.- Analogical reasoning for second generation expert systems.- Probabilistic inductive inference of indices in enumerable classes of total recursive functions.- Inductive inference for solving divergence in Knuth-Bendix completion.- Towards a set of inference rules for solving divergence in Knuth-Bendix completion.- Inductive synthesis of programs for symbolic sequences processing.- Inductive synthesis of encoding for algebraic abstract data types.