Computer Science
Computer Science
bullet Rowan bio professor helps trace evolution of horses, more via fossils | More

bullet A holiday benefit with Frankie Avalon...and friends | More

bullet Joanne Connor named WPN institutional representative | More

bullet B-TV: NYC art show celebrates David Bianculli’s love of television | More

bullet CMSRU Faculty Participate in Groundbreaking Epilepsy Study | 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.