Computer Science
Computer Science
bullet Football team to hold Be the Match Registry on April 22 | More

bullet Professor provides tips for parents of children recently diagnosed with autism spectrum disorder | More

bullet Rowan University police launch body worn cameras program | More

bullet A swimming success: Rowan sophomore wins two national titles | More

bullet Rowan Engineering hosting summer 2015 programs for middle and high school students | 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.