Unfold/fold transformation of stratified programs (Q1177929)

One of the most important properties of program transformation is equivalence preservation. In \textit{H. Tamaki} and \textit{T. Sato} [Unfold/fold transformation of logic programs, Proc. 2nd Int. Logic Programming Conf., 127-138 (1984)]\ a framework for transformation of logic programs was proposed. The author describes an extended unfold/fold transformation preserving (in addition to the success set) the finite failure set and allowing its further extension to stratified programs. It is proved that in the case of stratified programs both the success set and the finite failure set are preserved. In the appendix also the preservation of perfect model semantics is proved.