Schema-Guided Synthesis of Prolog Programs

We thus quickly enumerate here a few approaches to using schemas for assisting the manual construction of logic programs. 

In the area of manual or computer-aided program construction (for experts), [Deville and Burnay 89] and [Deville 87,90] suggest a divide-and-conquer schema. They also discuss interesting transformation schemas, based on (structural or computational) generalization. 

A similar study is made by [O Keefe 90], who uses algebraic specifications. The predicates of such specifications can be directly plugged into given logic program schemas. Several schemas may be applicable according to the properties (associativity, commutativity, existence of left identities, and so on) of the identified predicates. 

---