T. S. Gegg-Harrison. Exploiting Program Schemata in a Prolog Tutoring System. Technical Report CS-1993-11, Department of Computer Science, Duke University; Durham, North Carolina, U.S.A., April 1993. Reformatted version of PhD dissertation with the same title and equivalent content.  @ NUS  Home/Search   Document Details and Download   Summary   Related Articles

....replaced by vectors of literals. Finally, if necessary, the sequences of calls are generalised in accordance with the predicates in the clauses. Unmodi ed clauses are replaced by vectors of clauses. This process is akin to the most speci c generalisation algorithm for program schemata given in [4]. We have formally de ned a generalisation procedure. It works by examining the constructs of an initial transformation and trying to build the set of constraints from the pairs of schemata. Initially, when a pair of procedures and their respective calls are matched to the de nition of a ....

T. S. Gegg-Harrison. Exploiting Program Schemata in a Prolog Tutoring System. Technical Report CS-1993-11, Department of Computer Science, Duke University; Durham, North Carolina, U.S.A., April 1993. Reformatted version of PhD dissertation with the same title and equivalent content.

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.