Computer Science
Computer Science
bullet B-TV: NYC art show celebrates David Bianculli’s love of television | More

bullet CMSRU Faculty Participate in Groundbreaking Epilepsy Study | More

bullet Knowledge is Power: New Rowan sculpture celebrates joy of learning | More

bullet Rowan unveils cast bronze plaque to honor World War II veterans | More

bullet “Rowan Choice” can save freshmen about $10,000 | 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.