Computer Science
Computer Science
bullet Rowan University IEEE to host international visitors for Sumo Robot Competition | More

bullet Assoc. Prof makes Ironman World Championship, raises funds to fight pancreatic cancer | More

bullet Rowan film project supports White House fight against sexual assault on campus | More

bullet Wanted: Glassboro’s most #RowanPROUD family | More

bullet South Jersey state colleges hit record high enrollment | 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.