1986 | | | **Aggregating Inductive Expertise** - *Daniel N. Osherson, Michael Stob and Scott Weinstein* |

| | | **Machine Learning of Nearly Minimal Size Grammars** - *J. Case and H. Chi* |

| | | **Learning Concepts by Asking Questions** - *C. Sammut and R. Banerji* |

| | | **Understanding the Nature of Learning: Issues and Research Directions** - *R. M. Michalski* |

| | | **Stochastic Complexity and Sufficient Statistics** - *J. Rissanen* |

| | | **Probability and Measure** - *Patrick Billingsley* |

| | | **Experimental Goal Regression: A Method for Learning Problem-Solving Heuristics** - *Bruce W. Porter and Dennis F. Kibler* |

| | | **A General Framework for Parallel Distributed Processing** - *D. E. Rumelhart, G. E. Hinton and J. L. McClelland* |

| | | **On the Inference of Programs Approximately Computing the Desired Function** - *C. Smith and M. Velauthapillai* |

| | | **A Framework for Empirical Discovery** - *P. Langley and B. Nordhausen* |

| | | **Learning Distributed Representations of Concepts** - *G. E. Hinton* |

| | | **Stochastic Relaxation Methods for Image Restoration and Expert Systems** - *S. Geman* |

| | | **On the Complexity of Effective Program Synthesis** - *R. Wiehagen* |

| | | **Reasoning by Analogy as a Partial Identity between Models** - *Makoto Haraguchi and Setsuo Arikawa* |

| | | **On Barzdin's Conjecture** - *Thomas Zeugmann* |

| | | **On Machine Learning** - *Pat Langley* |

| | | **Learning Representations By Back-Propagating Errors** - *D. E. Rumelhart, G. E. Hinton and R. J. Williams* |

| | | **Using telltales in developing program test sets** - *J. Cherniavsky and C. Smith* |

| | | **Explanation-Based Learning: An Alternative View** - *Gerald Dejong and Raymond Mooney* |

| | | **On the Inductive Inference of Programs with Anomalies** - *M. Velauthapillai* |

| | | **Inductive Inference Hierarchies: Probabilistic vs Pluralistic** - *R. P. Daley* |

| | | **An Analysis of a Learning Paradigm** - *D. Osherson, M. Stob and S. Weinstein* |

| | | **Inductive inference by refinement** - *P. Laird* |

| | | **Identification in the Limit of First Order Structures** - *D. N. Osherson and S. Weinstein* |

| | | **Studies on Inductive Inference from Positive Data** - *T. Shinohara* |

| | | **The Disjunctive Learning Problem** - *M. Fulk* |

| | | **Machine Learning of Inductive Bias** - *P. E. Utgoff* |

| | | **Distributional Expectations and the Induction of Category Structure** - *M. J. Flannagan, L. S. Fried and K. J. Holyoak* |

| | | **Machine Learning and Discovery** - *Pat Langley and Ryszard S. Michalski* |

| | | **Inductive Inference of Functions From Noised Observations** - *J. Grabowski* |

| | | **A Theory and Methodology of Inductive Inference** - *R. S. Michalski* |

| | | **A General Framework for Induction and a Study of Selective Induction** - *Larry Rendell* |

| | | **Parallel Distributed Processing - Explorations in the Microstructure of Cognition** - *David E. Rumelhart, James L. McClelland and the PDP Research Group* |

| | | **An Algebraic Framework for Inductive Program Synthesis** - *K. P. Jantke* |

| | | **Some Problems on Inductive Inference from Positive Data** - *T. Shinohara* |

| | | **Learning Internal Representations by Error Propagation** - *D. E. Rumelhart, G. E. Hinton and R. J. Williams* |

| | | **Machine Learning: An Artificial Intelligence Approach** - *Ryszard S. Michalski and Jaime G. Carbonell and Tom M. Mitchell* |

| | | **Determining Arguments of Invariant Functional Descriptions** - *Mieczyslaw M. Kokar* |

| | | **Learning from positive-only examples** - *R. Berwick* |

| | | **On the Inference of Sequences of Functions** - *W. I. Gasarch and C. H. Smith* |

| | | **Chemical Discovery as Belief Revision** - *Donald Rose and Pat Langley* |

| | | **Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists** - *D. N. Osherson, M. Stob and S. Weinstein* |

| | | **Integrating Quantitative and Qualitative Discovery: The ABACUS System** - *Brian C. Falkenhainer and Ryszard S. Michalski* |

| | | **Learning Machines** - *J. Case* |

| | | **Editorial: The Terminology of Machine Learning** - *Pat Langley* |

| | | **Inductive Inference of approximations** - *James S. Royer* |

| | | **Some Results in the Theory of Effective Program Synthesis - Learning by Defective Information** - *G. Schäfer-Richter* |

| | | **A General Theory of Discrimination Learning** - *P. Langley* |

| | | **Editorial: Human and Machine Learning** - *Pat Langley* |

| | | **Learning at the Knowledge Level** - *Thomas G. Dietterich* |

| | | **Induction of Decision Trees** - *J. R. Quinlan* |

| | | **On the Complexity of Program Synthesis from Examples** - *R. Wiehagen* |

| | | **On the Complexity of Inductive Inference** - *Robert P. Daley and Carl H. Smith* |

| | | **Linear Function Neurons: Structure and Training** - *S. E. Hampson and D. J. Volper* |

| | | **Stochastic Complexity and Modeling** - *J. Rissanen* |

| | | **Explanation-Based Generalization: A Unifying View** - *Tom M. Mitchell, Richard M. Keller and Smadar T. Kedar-Cabelli* |

| | | **The Effect of Noise on Concept Learning** - *J. R. Quinlan* |

| | | **Towards the Development of an Analysis of Learning Algorithms** - *R. P. Daley* |

| | | **Chunking in Soar: The Anatomy of a General Learning Mechanism** - *John E. Laird, Paul S. Rosenbloom and Allen Newell* |

| | | **Stratified Inductive Hypothesis Generation** - *Zs. Szabó* |

| | | **Parallel Distributed Processing (Volume I: Foundations)** - *D. E. Rumelhart and J. L. McClelland* |

| | | **How Fast is Program Synthesis from Examples** - *R. Wiehagen* |

| | | **Incremental Learning from Noisy Data** - *Jeffrey C. Schlimmer and Jr. Richard H. Granger* |

| | | **A Theory of Historical Discovery: The Construction of Componential Models** - *Jan M. Zytkow and Herbert A. Simon* |

| January | | **An Introduction to Hidden Markov Models** - *L. R. Rabiner and B. H. Juang* |

| February | | **Genetic AI-Translating Piaget into Lisp** - *G. L. Drescher* |

| May | | **CONSENSUS: A Statistical Learning Procedure in a Connectionist Network** - *G. J. Goetsch* |

| | | **On the Logic of Representing Dependencies by Graphs** - *J. Pearl and A. Paz* |

| June | | **A Lemma on the Multiarmed Bandit Problem** - *J. N. Tsitsiklis* |

| | | **Types of queries for concept learning** - *D. Angluin* |