1. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy Proof verification and hardness of approximation problems. In FOCS, 1992.
2. Polynomial-time inference of all valid implications for horn and related formulae;Boros;Annals of Mathematics and Artificial Intelligence,1990
3. The difficulties of learning logic programs with cut;Bergadeno;Journal of AI Research,1993
4. G. Benedek and A. Itai. Nonuniform learnability. In ICALP-88, pages 82–92, 1988.
5. Gerhard Brewka. Preferred subtheories: An extended logical framework for default reasoning. In IJCAI-89, pages 1043–48, Detroit, August 1989.