Recursive logic programs

A few researchers have tackled this lack of discipline in the synthesis of recursive logic programs from examples for instance, [Tinkham 90] and [Sterling and Kirschenbaum 93] investigate the use of schemas to guide synthesis. Curiously, the now virtually defunct research on trace-based synthesis of functional programs from examples [Summers 77] [Biermann 78] did not suffer from such a marked lack of discipline , even though this research preceded ILP research. 

Hermann, M. (1992), On the relation between primitive recursion, schema-tization, and divergence, in H. Kirchner k G. Levi, eds, Proceedings 3rd Conference on Algebraic and Logic Programming, Volterra (Italy) , Vol. 632 of Lecture Notes in Computer Science, Springer-Verlag, pp. 115-127. 

User memberll. (The user here anticipates that the target logic program is recursive, and that no other predicates will be useful.)... 

In terms of alternative techniques to the MSG Method, there is of course the whole literature on empirical learning, and inductive logic programming (ILP), as surveyed in Chapter 3. But it should be noted that the MSG Method only aims at the synthesis of a sub-class of concept descriptions, namely non-recursive algorithms that are implemented in terms of the =/2 primitive only, and whose intended relation, though unknown as a whole, is however known to feature a given dataflow pattern between... 

Figure 8.4 Program to find an element in a list of elements by means of list processing language (LISP) and a recursive programming in logic (PROLOG) procedure.

---