Curried least general generalization: A framework for higher order concept learning
- 209 Downloads
Continued progress with research in inductive logic programming relies on further extensions of their underlying logics. The standard tactics for extending expressivity include a generalization to higher order logics, which immediately forces attention to the computational complexity of higher order reasoning.
A major thread of inductive logic programming research has focussed on the identification of preferred hypothesis sets, initiated by Plotkin's work on least general generalizations (LGGs). Within higher order frameworks, a relevant extension of LGG is Furukawa's hyper least general generalization (HLGG) [FIG97].
We present a relevant higher order extension of Furukawa's HLGG based on currying, which we call Curried Least General Generalization (CLGG). The idea is that the formal difficulties with the reasoning complexity of a higher order language can be controlled by forming new hypothetical terms restricted to those obtainable by Currying. This technique subsumes the inductive generalization power of HLGG, provides a basis for a significant extension of first order ILP, and is theoretically justified within a well understood formal foundation.
Unable to display preview. Download preview PDF.
- [FIG97]K. Furukawa, M. Imai, and R. Goebel. Hyper least general generalization and its application to higher-order concept learning. Research Memo IEI-RM 97001, SFC Research Institute, Keio University, 5322 Endo, Fujisawa-shi, Kanagawa 252, Japan, 1997.Google Scholar
- [FM92]C. Feng and S. Muggleton. Towards inductive generalisation in higher order logic. In D. Sleeman and P. Edwards, editors, Proceedings of the Ninth International Workshop on Machine Learning, San Mateo, California, 1992. Morgan Kaufman.Google Scholar
- [GM93]M.J.C. Gordon and T.F. Melham. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.Google Scholar
- [KW92]J. Kietz and S. Wrobel. Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models. Inductive Logic Programming. Academic Press, 1992.Google Scholar
- [MF90]S. Muggleton and C. Feng. Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, Tokyo, Japan, 1990.Google Scholar
- [MJ94]Stephen Muggleton and C.David Page Jr. Beyond first-order learning Inductive learning with higher-order logic. Technical Report PRG-TR-13-94, Oxford University, UK, 1994.Google Scholar
- [Plo70]G.D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 6, pages 153–163. Edinburgh University Press, Edinburgh, 1970.Google Scholar
- [Plo71a]G.D. Plotkin. Automatic methods of inductive inference. Ph.d. dissertation, University of Edinburgh, Edinburgh, Scotland, 1971.Google Scholar
- [Plo71b]G.D. Plotkin. A further note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 6, pages 101–124. Edinburgh University Press, Edinburgh, 1971.Google Scholar
- [Pop70]R.J. Popplestone. An experiment in automatic deduction. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, pages ???-??? Edinburgh University Press, Edinburgh, 1970.Google Scholar
- [Rae93]Luc De Raedt. A brief introduction to inductive logic programming. In Proceedings of the 1993 International Symposium on Logic Programming, pages 45–51, Vancouver, Canada, October 26–29 1993.Google Scholar
- [RB92]L. De Raedt and M. Bruynooghe. Interactive theory revision: an inductive logic programming approach. Machine Learning, 8(2), 1992.Google Scholar