Computer Science
Computer Science
bullet CSMRU faculty member elected to lead National Disaster Life Support Education Consortium | More

bullet Exploring academics, enhancing social skills: Young Profs Exploration Camp to host 16 students | More

bullet Summer, sun and… snakes? | More

bullet WGLS-FM announces five inductees to station Hall of Fame | More

bullet Rowan hosts Attracting Women into Engineering for middle school girls | 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.