| 1982 | |  | Machine Inductive Inference and Language Identification - J. Case and C. Lynes |
| | | Learning and inductive inference - T L. R. C. K. Dietterich and R. Dromey |
| | | Syntactic Pattern Recognition and Applications - King Sun Fu |
| | | Inductive inference and computable one-one numberings - R. V. K. E. B. Freivalds and R. Wiehagen |
| | | Polynomial Time Inference of Extended Regular Pattern Languages - T. Shinohara |
| | | Generalization as search - T. M. Mitchell |
| | | Zur Konvergenzgeschwindigkeit von Strategien der induktiven Inferenz - H. R. Beick |
| | | Problems in Inductive Inference - J. Case |
| | | Polynomial time inference of pattern languages and its applications - T. Shinohara |
| | | Estimation of Dependences Based on Empirical Data - V. N. Vapnik |
| | | Inductive Inference and Computable One-one Numberings - R. Freivalds, E. B. Kinber and R. Wiehagen |
| | | Learning Strategies - D. Osherson, M. Stob and S. Weinstein |
| | | Criteria of Language Learning - D. N. Osherson and S. Weinstein |
| | | The use of tree derivatives and a sample support parameter for inferring tree systems - B. Levine |
| | | A Note on Formal Learning Theory - D. Osherson and S. Weinstein |
| | | The Power of Pluralism for Automatic Program Synthesis - C. Smith |
| | | Ideal learning machines - D. Osherson, M. Stob and S. Weinstein |
| | | Tradeoffs in the inductive inference of nearly minimal size programs - K. J. Chen |
| | | On Extensional Learnability - K. Wexler |
| | | A survey of the synthesis of LISP programs from examples - D. R. Smith |
| | | A note on the number of queries needed to identify regular languages - D. Angluin |
| | | Inductive inference and language identification - J. Case and C. Lynes |
| April | | Neural networks and physical systems with emergent collective computational abilities - J. J. Hopfield |
| July | | Inference of Reversible Languages - D. Angluin |
