
Analogical and Inductive Inference
International Workshop AII '89 Reinhardsbrunn Castle, GDR, October 1-6, 1989, Proceedings
Mitarbeit: Jantke, Klaus P.
Versandkostenfrei!
Versandfertig in 1-2 Wochen
39,99 €
inkl. MwSt.
PAYBACK Punkte
20 °P sammeln!
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.- ...
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.