Computer Science
Computer Science
bullet From tableside to curbside, Gourmet Dining expands food choices | More

bullet The next building boom: Construction keeps pace with growing university | More

bullet Y'all come!: A weekend to celebrate the Rowan family | More

bullet Rowan and Special Olympics help people Get FIT | More

bullet Got Rowan pride? Homecoming contest looking to identify Glassboro family with the most Prof pride | 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.