| 1979 | |  | Theorie der Zeichenerkennung - V. N. Vapnik |
| | | Refinements of inductive inference by Popperian machines - J. Case and S. Ngo-Manguelle |
| | | Automatic discovery of heuristics for nondeterministic programs - S. J. Stolfo and M. C. Harrison |
| | | Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings - D. Angluin and L. G. Valiant |
| | | Construction of natural language sentence acceptors by a supervised learning technique - D. Coulon and D. Kayser |
| | | Mathematical learning theory: a formalized, axiomatic, abstract approach - R. J. Hendel |
| | | Learning and generalization of characteristic descriptions: evaluation criteria and comparative review of selected methods - T. G. Dietterich and R. S. Michalski |
| | | Complexity of mechanized hypothesis formation - P. Pudlak and F. N. Springsteel |
| | | Automatic Discovery Heuristics for Nondeterministic Programs From Sample Execution Traces - S. J. Stolfo |
| | | Distribution-Free Performance Bounds with the Resubstitution Error Estimate - L. P. Devroye and T. J. Wagner |
| | | Characterization of a class of functions synthesized by a Summers-like method using a B.M.W. matching technique - J. P. Jouannaud and Y. Kodratoff |
| | | Inference of functions with an interactive system - J. P. Jouannaud and G. Guiho |
| | | On the Principle Capabilities of Probabilistic Algorithms in Inductive Inference - R. Freivalds |
| | | An inductive inference bibliography - C. H. Smith |
| | | Inductive inference with additional information - R. V. Freivalds and R. Wiehagen |
| | | Automatic Synthesis of Programs and Inductive Inference of Functions - K. Jantke |
| | | Formal Models of Language Learning - S. Pinker |
| | | A class of functions synthesized from a finite number of examples and a LISP program scheme - Y. Kodratoff |
| | | Leistungsfahigkeit und Kmpliziertheit universeller Verfahren zur Erkennung allgemein-rekursiver Funktinen - K. Jantke |
| | | Refinements of Inductive Inference by Popperian Machines - J. Case and S. Ngo Manguelle |
| | | Natural properties of strategies identifying recursive functions - K. P. Jantke |
| | | Hierarchies of Identification Criteria for Mechanized Inductive Inference - C. H. Smith |
| | | Finite identification of general recursive functions by probabilistic strategies - R. V. Freivalds |
| January | | Maryanski’s grammatical inferencer - B. R. Gaines |
| October | | Capacity and Error Estimates for Boolean Classifiers with Limited Complexity - J. Pearl |
