论文信息 - Two Methods for Improving Inductive Logic Programming Systems

Two Methods for Improving Inductive Logic Programming Systems

In this paper we describe two methods for improving systems that induce disjunctive Horn clause definitions. The first method is the well-known use of argument types during induction. Our novel contribution is an algorithm for extracting type information from the example set mechanically. The second method provides a set of clause heads partitioning the example set in disjuncts according to structural properties. Those heads can be used in top-down inductive inference systems as starting point of the general-to-specific search and reduce the resulting space of clause bodies.

[1] Feliks Kluzniak. Type Synthesis for Ground Prolog , 1987, ICLP.

[2] T. Shinohara,et al. Polynomial Time Inference of Unions of Tree Pattern Languages , 1991 .

[3] Ehud Shapiro,et al. Algorithmic Program Debugging , 1983 .

[4] Masayuki Numao,et al. Efficient Learning of Logic Programs with Non-determinant, Non-discriminating Literals , 1991, ML.

[5] Ehud Shapiro,et al. A Type System for Logic Programs , 1988, J. Log. Program..

[6] Rüdiger Wirth,et al. Constraints on Predicate Invention , 1991, ML.

[7] I. Stahl,et al. General-to-specific learning of Horn clauses from positive examples , 1992, CompEuro 1992 Proceedings Computer Systems and Software Engineering.