Recent Results on Boolean Concept Learning

[1]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[2]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[3]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[4]  David Haussler,et al.  Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.

[5]  David Haussler.  Quantifying the Inductive Bias in Concept Learning (Extended Abstract) , 1986, AAAI.

[6]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[7]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[8]  L. G. Valiant.  Deductive Learning , 2017, Encyclopedia of Machine Learning and Data Mining.

[9]  Ryszard S. Michalski,et al.  A Theory and Methodology of Inductive Learning , 1983, Artif. Intell..

[10]  Tom M. Mitchell,et al.  Acquisition of Appropriate Bias for Inductive Concept Learning , 1982, AAAI.

[11]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[12]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[13]  Temple F. Smith.  Occam's razor , 1980, Nature.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

[16]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..