Computer Science
Computer Science
bullet Jazz Festival celebrates 45 years of music and education | More

bullet Michael Eric Dyson challenges, entertains during 29th annual MLK Jr. scholarship breakfast | More

bullet University's spring Arts schedule offers eclectic mix | More

bullet 'Change of Tides': World War II veteran’s incredible story documented in student film | More

bullet Rowan tech park board adds science/tech & business experts | 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.