189
click to vote
LOPSTR
15 years 11 months ago
1994 Springer 
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
178
click to vote
LOPSTR
15 years 11 months ago
1994 Springer 
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
176
click to vote
LOPSTR
15 years 11 months ago
1994 Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
|
Automated Reasoning