Computer Science
Computer Science
bullet Speakers to offer insights, inspiration during Disability Awareness Week at Rowan | More

bullet Write On! New scholarship awards $35,000 to freshman writers | More

bullet RTF alumni nab seven Emmy Awards (six regional, one in Primetime!) | More

bullet Executive from Nation's Top Financial Planning and Investment Management Firm elected Chair of Rowan University Foundation Board | More

bullet Baby boomer beacon: Rowan Radio turns 50 | 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.