1. Aizenstein, H., “On the Learnability of Disjunctive Normal Form Formulas and Decision Trees,”Ph. D. thesis, University of Illinois at Urbana-Champaign, 1992.
2. Angluin, D., Frazier, M. and Pitt, L., “Learning Conjunctions of Horn Clauses,”Machine Learning, 9, pp. 147–164, 1992.
3. Angluin, D., “Queries and Concept Learning,”Machine Learning, 2 4, 1988.
4. Angluin, D., “Equivalence Queries and Approximate Fingerprints” InProceedings of the 1989 Workshop on Computational Learning Theory, Santa Cruz, California 1989.
5. Arimura, H., Ishizaka, H., and Shinohara, T., “Polynomial Time Inference of a Subclass of Context-Free Transformations,” inProceedings of the Fifth Workshop on Computational Learning Theory (COLT-92), The Association for Computing Machinery, New York, pp. 136–143 1992.