On a sufficient condition for the existence of most specific hypothesis in progol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1297, Issue , 1997, Pages 157-164

  Furukawa, Koichi ^a   Murakami, Tomoko ^a   Ueno, Ken ^a   Ozaki, Tomonobu ^a   Shimazu, Keiko ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957881151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540635149_44     Document Type: Conference Paper

References (8)

1. Breiman, L., Friedman, J. H., Olshen, R. A. and Stone, C. J.: Classification and Regression Trees. Wadsworth, Belmont (1984).
2. Muggleton, S.: Inverse Entailment and Progol. New Generation Computing, Vol.13, pp.245-286 (1995).
3. Muggleton, S. and Feng, C.: Efficient induction of logic programs. In Proc. First Conference on Algorithmic Learning Theory, pp.368-381, Ohmsha, Tokyo (1990).
4. Plotkin, G.D.: A note on inductive generalization. In Meltzer, B. and Michie, D. editors, Machine Intelligence 5, pp. 153-163, Edinburgh University Press (1970).
5. Quinlan, J.R.: Induction of decision trees. Machine Learning, 1(1), pp.81-106 (1986).
6. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA (1993).
7. Shapiro, E.: Inductive Inference of Theories from Facts. Research Report 192, Department of Computer Science, Yale University (1981).
8. Yamamoto, A.: Improving Theories for Inductive Logic Programming Systems with Ground Reduced Programs. Technical Report, Forschungsbericht AIDA-96-19 FG Intellektik FB Informatik TH Darmstadt (1996).