Basic Prolog Schemata
S T Gegg-Harrison · 1989
The notion of most specific generalization of first-order logical formulas is extended to produce second-order schemata and an improved algorithm is presented. This notion is applied to a large number of simple recursive list processing Prolog programs to create a hierarchy of Prolog schemata. Central to this Prolog Schema Hierarchy are fourteen basic level schemata which are sufficient for representing a vast number of common simple recursive list processing programs. A Prolog Tutoring System is proposed which uses an ``annotated'''' version of the Prolog Schema Hierarchy as its underlying knowledge structure.