Computer Science
Computer Science
bullet Rowan team places 10th in Supermileage competition | More

bullet Cooper Medical School of Rowan University receives major federal grant | More

bullet Rowan Research gives hope to patients of Canavan disease through commercial agreement with Bamboo Therapeutics, Inc. | More

bullet Rowan engineering, med students seeks solutions to health care problems | More

bullet 10th graders attend free 3-week Rowan academy, earn three college credits | 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.