Computer Science
Computer Science
bullet Rowan University takes the handlebars in making a difference: Fourth annual Mustache March to benefit American Stroke Association | More

bullet Rowan Innovation Venture Fund accepting applications for financing | More

bullet A community of giving: First-ever #RowanGIVESDay raises $65K+ for University programs and scholarships | More

bullet Rowan researcher targets stem cell-based therapy for rare childhood disease | More

bullet Rowan Radio wins prestigious BEA awards | 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.