Summary
This paper describes how Inductive Logic Programming is related to Logic Programming. It first introduces Model Inference System developed by Ehud Shapiro and then new Inductive Logic Programming technologies. It shows the technical progress from “subsumption” to “logical entailment” and insists the importance of utilizing “background knowledge.” A new computational model for computing induction is presented. It is defined by an iteration consisting of the computation of the Most Specific Hypothesis (MSH) and search in a reduced concept lattice brought by the MSH. This computation model provides an efficient algorithm for computing induction in terms of deduction followed by an efficient search algorithm. This implies that the inversion of deduction can be solved rather efficiently when the problem is restricted to Horn clauses.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Furukawa, K., Murakami, T., Ueno, K., Ozaki, T., 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-Verlag, 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).
Moyle, S., Muggleton, S. Learning Programs in the Event Calculus, Proc. of ILP-97, Lecture Notes in Artificial Intelligence 1297, Springer-Verlag, 205 –212, 1997.
Muggleton, S. Inverting Implication, Proc. of ILP92, 19 –39, ICOT Technical Memorandum: TM-1182, 1992.
Muggleton, S. Inverse Entailment and Progol, New Generation Computing, Vol. 13, 245–286, 1995.
Muggleton, S. Completing Inverse Entailments, Proc. of ILP98, Lecture Notes in Artificial Intelligence 1446, Springer-Verlag, pp. 245–249, 1998.
Murakami, T., Furukawa, K., Ozaki, T. Realization of Abduction by Inverse Entailment and its Equivalence to Partial Deduction, Proceedings of 32nd SIG- FAI, JSAI, March 1998.
Ozaki, T., Furukawa, K., Murakami, T., Ueno, K. Realizing Progol by Forward Reasoning, Proc. of ILP-97, Lecture Notes in Artificial Intelligence 1297, Springer-Verlag, 227–234, 1997.
Plotkin, G.D. Automatic Method of Inductive Inference, PhD thesis, Edinburgh University, 1971.
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-Verlag, 296–308, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Furukawa, K. (1999). From Deduction to Induction: Logical Perspective. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds) The Logic Programming Paradigm. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60085-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-60085-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64249-4
Online ISBN: 978-3-642-60085-2
eBook Packages: Springer Book Archive