Computer Science
Computer Science
bullet Henry M. Rowan Family Foundation commits $15M to Rowan University | More

bullet Cooper Medical School of Rowan University wins national video challenge | More

bullet Building community in Camden—one garden bed at a time | More

bullet New business: Ground broken on new Rohrer College of Business building | More

bullet Rev your Prius engines | 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.