Computer Science
Computer Science
bullet Rowan announces inaugural Excellence in Diversity awards | More

bullet Rowan University students present cutting-edge research at the 17th Annual STEM Student Research Symposium | More

bullet “Fly Me to the Moons!” plays at Edelman Planetarium | More

bullet The Princeton Review names Rowan to 2014 "Green Guide" | More

bullet At Rowan Graduate Commencement: Levine to speak to graduates; Bartolozzi to receive honorary degree | 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.