Algorithmic Learning Theory: 4th International Workshop on Analogical and Inductive Inference, AII '94 5th International Workshop on Algorithmic Learning Theory, ALT '94 Reinhardsbrunn Castle, Germany October 10–15, 1994 Proceedings

Towards efficient inductive synthesis from input/output examples....Pages 1-1
Deductive plan generation....Pages 2-5
From specifications to programs: Induction in the service of synthesis....Pages 6-7
Average case analysis of pattern language learning algorithms....Pages 8-9
Enumerable classes of total recursive functions: Complexity of inductive inference....Pages 10-25
Derived sets and inductive inference....Pages 26-39
Therapy plan generation as program synthesis....Pages 40-55
A calculus for logical clustering....Pages 56-63
Learning with higher order additional information....Pages 64-75
Efficient learning of regular expressions from good examples....Pages 76-90
Identifying nearly minimal Gödel numbers from additional information....Pages 91-99
Co-learnability and FIN-identifiability of enumerable classes of total recursive functions....Pages 100-105
On case-based represent ability and learnability of languages....Pages 106-120
Rule-generating abduction for recursive prolog....Pages 121-136
Fuzzy analogy based reasoning and classification of fuzzy analogies....Pages 137-148
Explanation-based reuse of prolog programs....Pages 149-160
Constructive induction for recursive programs....Pages 161-175
Training digraphs....Pages 176-186
Towards realistic theories of learning....Pages 187-209
A unified approach to inductive logic and case-based reasoning....Pages 210-210
Three decades of team learning....Pages 211-228
On-line learning with malicious noise and the closure algorithm....Pages 229-247
Learnability with restricted focus of attention guarantees noise-tolerance....Pages 248-259
Efficient algorithm for learning simple regular expressions from noisy examples....Pages 260-271
A note on learning DNF formulas using equivalence and incomplete membership queries....Pages 272-281
Identifying regular languages over partially-commutative monoids....Pages 282-289
Classification using information....Pages 290-300
Learning from examples with typed equational programming....Pages 301-316
Finding tree patterns consistent with positive and negative examples using queries....Pages 317-332
Program synthesis in the presence of infinite number of inaccuracies....Pages 333-348
On monotonic strategies for learning r.e. languages....Pages 349-364
Language learning under various types of constraint combinations....Pages 365-378
Synthesis algorithm for recursive processes by μ-calculus....Pages 379-394
Monotonicity versus efficiency for learning languages from texts....Pages 395-406
Learning concatenations of locally testable languages from positive data....Pages 407-422
Language learning from good examples....Pages 423-437
Machine discovery in the presence of incomplete or ambiguous data....Pages 438-452
Set-driven and rearrangement-independent learning of recursive languages....Pages 453-468
Refutably probably approximately correct learning....Pages 469-483
Inductive inference of an approximate concept from positive data....Pages 484-499
Efficient distribution-free population learning of simple concepts....Pages 500-515
Constructing predicate mappings for Goal-Dependent Abstraction....Pages 516-531
Learning languages by collecting cases and tuning parameters....Pages 532-546
Mutual information gaining algorithm and its relation to PAC-learning algorithm....Pages 547-559
Inductive inference of monogenic pure context-free languages....Pages 560-573