1. Arimura, H.: Completeness of depth-bounded resolution in logic programming. In: Proceedings of the 6th Conference, Japan Soc. Software Sci. Tech. (1989) 61–64
2. Arimura, H.: Learning Acyclic First-Order Horn Sentences from Entailment In: Li, M., Maruoka, A. (eds.): Algorithmic Learning Theory: Eighth International Workshop (ALT’ 97). LNAI, Vol. 1316. Springer-Verlag (1997) 432–445
3. Arimura, H., Shinohara, T.: Inductive inference of Prolog programs with linear data dependency from positive data. In: Jaakkola, H., Kangassalo, H., Kitahashi, T., Markus, A. (eds.): Proc. Information Modelling and Knowledge Bases V. IOS Press (1994) 365–375
4. Cohen, W.W.: PAC-Learning non-recursive Prolog clauses. Artificial Intelligence 79 (1995) 1–38
5. Cohen, W.W.: PAC-Learning Recursive Logic Programs: Efficient Algorithms. Journal of Artificial Intelligence Research 2 (1995) 501–539