Computer Science
Computer Science
bullet Of "Ellen" and Emmys: RTF grads go Hollywood | More

bullet CMSRU researcher receives NIH Grant to study impact of carbon dioxide following cardiac arrest | More

bullet Lehrman named dean of Rowan’s Rohrer College of Business | More

bullet College of Engineering among U.S. schools committed to educating 20,000 students to meet “Grand Challenges” | More

bullet Rowan teaches the world | 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.