On the completion of the most specific hypothesis computation in inverse entailment for mutual recursion

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

Volumn 1532, Issue , 1998, Pages 315-325

  Furukawa, Koichi ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE PROBLEMS;

BACK-GROUND KNOWLEDGE; COMPUTATION ALGORITHM; COUNTER EXAMPLES; DEFINITE CLAUSE; FIRST ORDER THEORIES; INVERSE ENTAILMENT; MUTUAL RECURSION; POSITIVE EXAMPLES;

COMPUTATION THEORY;

EID: 84949211308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49292-5_28     Document Type: Conference Paper

References (11)

1. Breiman, L., Friedman, J.H., Olshen, R.A. and Stone, C. Classification And Regression Trees, Belmont, CA: Wadsworth International Group, 1984.
2. Furukawa, K., Murakami, T., Ueno, K., Ozaki, T. and Shimaze, K. On a Sufficient Condition for the Existence of Most Specific Hypothesis in Progol, Proc. of ILP-97, Lecture Notes in Artificial Intelligence 1297, Springer, 157-164, 1997.
3. Furukawa, K. On the Completion of the Most Specific Hypothesis in Inverse Entailment for Mutual Recursion and Abductive ILP Setting, Proceedings of 32nd SIG-FAI, JSAI, March, 1998 (in Japanese).
4. Marcinowski, J. and Pacholski, L. Undecidability of the Horn-clause implication problem, Proc. of 33rd Annual Symposium on Foundations of Computer Science, 354-362, 1992.
5. Muggleton, S. Inverting Implication, Proc. of ILP92, 19-39, ICOT Technical Memorandom: TM-1182, 1992.
6. Muggleton, S. Inverse Entailment and Progol, New Generation Computing, Vol.13, 245-286, 1995
7. Plotkin, G.D. Automatic Method of Inductive Inference, PhD thesis, Edinburgh University, 1971.
8. Quinlan, J.R. Induction of decision trees,Machine Learning, 1(1), 81-106, 1986
9. Quinlan, J.R. C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, CA, 1993
10. 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.
11. Yamamoto, A. Which Hypotheses Can Be Found with Inverse Entailment? Proc. of ILP-97, Lecture Notes in Artificial Intelligence 1297, Springer, 296-308, 1997.