Abstract
In this paper, we introduce a complete algorithm for computing the most specific hypothesis (MSH) in Inverse Entailment when the background knowledge is a set of definite clauses and the positive example is a ground atom having the same predicate symbol as that of the target predicate to be learned
Muggleton showed that for any first order theory (background knowledge) B and a single clause (a positive example) E, the MSH can be computed by first computing all ground (positive and negative) literals which logically follow from B∧¬E and negating their conjunction. However, Yamamoto gave a counter example and indicated that Muggleton’s proof contains error. Furukawa gave a sufficient condition to guarantee the above algorithm to compute the MSH. Yamamoto defined a class of problems where the algorithm computes the MSH. In this paper, we extend the MSH computation algorithm to ensure that it computes the MSH correctly under the condition described above
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breiman, L., Friedman, J.H., Olshen, R.A. and Stone, C. Classification And Regression Trees, Belmont, CA: Wadsworth International Group, 1984.
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.
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).
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.
Muggleton, S. Inverting Implication, Proc. of ILP92, 19-39, ICOT Technical Memorandom: TM-1182, 1992.
Muggleton, S. Inverse Entailment and Progol, New Generation Computing, Vol.13, 245–286, 1995
Plotkin, G.D. Automatic Method of Inductive Inference, PhD thesis, Edinburgh University, 1971.
Quinlan, J.R. Induction of decision trees, Machine Learning, 1(1), 81–106, 1986
Quinlan, J.R. C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, CA, 1993
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.
Yamamoto, A. Which Hypotheses Can Be Found with Inverse Entailment? Proc. of ILP-97, Lecture Notes in Artificial Intelligence 1297, Springer, 296–308, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furukawa, K. (1998). On the Completion of the Most Specific Hypothesis Computation in Inverse Entailment for Mutual Recursion. In: Arikawa, S., Motoda, H. (eds) Discovey Science. DS 1998. Lecture Notes in Computer Science(), vol 1532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49292-5_28
Download citation
DOI: https://doi.org/10.1007/3-540-49292-5_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65390-5
Online ISBN: 978-3-540-49292-4
eBook Packages: Springer Book Archive