论文信息 - Curried least general generalization: A framework for higher order concept learning

Curried least general generalization: A framework for higher order concept learning

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.

[1] Haskell B. Curry. Grundlagen der kombinatorischen Logik , 1930 .

[2] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[3] Stephen Muggleton,et al. Towards Inductive Generalization in Higher Order Logic , 1992, ML.

[4] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[5] Stephen Muggleton,et al. Efficient Induction of Logic Programs , 1990, ALT.

[6] Luc De Raedt,et al. A Brief Introduction to Inductive Logic Programming , 1993, ILPS.

[7] M. Schönfinkel. Über die Bausteine der mathematischen Logik , 1924 .

[8] L. D. Raedt. Interactive theory revision: an inductive logic programming approach , 1992 .

[9] Jorg-uwe Kietz,et al. Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models , 1992 .

[10] G. Plotkin. Automatic Methods of Inductive Inference , 1972 .

[11] Gopalan Nadathur,et al. Higher-order Horn clauses , 1990, JACM.