Computer Science
Computer Science
bullet Rowan Remembers: Candlelight vigil pays tribute to fallen Profs | More

bullet Hollybash to unite University community for end-of-semester fun | More

bullet PhysTEC grant helps Rowan students prepare to be the physics teachers of tomorrow | More

bullet Rohrer accounting majors earn NJSCPA scholarships | More

bullet Senior class gift donations to support scholarships for incoming students | More

Technical Report Number TR1997-1

Title
A theorem on refinement operators for logic program synthesis

Author
Nancy Lynn Tinkham
Department of Computer Science
Rowan University
Glassboro, NJ 08028
E-mail: nlt@rowan.edu

Abstract

Upward and downward refinement operators can be used to order the space of program schemata; these operators make program generalization and synthesis more efficient. This paper presents a theorem relating a pair of refinement operators to the sets of goals covered by schemata.