Suchen

Analogical and Inductive Inference

International Workshop AII '89 Reinhardsbrunn Castle, GDR, October 1-6, 1989, Proceedings
ISBN: 978-3-540-51734-4
GTIN: 9783540517344
Einband: Kartonierter Einband (Kt)
Verfügbarkeit: Folgt in ca. 5 Arbeitstagen
Unsere Staffelpreise:
Menge
10+
20+
50+
Preis
CHF 62.10
CHF 60.40
CHF 58.65
CHF 69.00
decrease increase

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.

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.

*
*
*
*
AutorJantke, Klaus P. (Hrsg.)
VerlagSpringer Berlin Heidelberg
EinbandKartonierter Einband (Kt)
Erscheinungsjahr1989
Seitenangabe352 S.
AusgabekennzeichenEnglisch
MasseH23.5 cm x B15.5 cm x D2.0 cm 534 g
Auflage1989
Gewicht534
ISBN978-3-540-51734-4

Weitere Titel von Klaus P. (Hrsg.) Jantke

Filters
Sort
display