BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
- 1 June 2002
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 13 (03) , 387-403
- https://doi.org/10.1142/s0129054102001175
Abstract
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs typically fold using a single, non-recursive clause i.e. the folding transformation is very restricted. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various model theoretic semantics of normal logic programs including the well-founded model and stable model semantics.Keywords
This publication has 5 references indexed in Scilit:
- Total correctness by local improvement in the transformation of functional programsACM Transactions on Programming Languages and Systems, 1996
- Simultaneous Replacement in Normal ProgramsJournal of Logic and Computation, 1996
- A transformation system for deductive database modules with perfect model semanticsTheoretical Computer Science, 1993
- Equivalence-preserving first-order unfold/fold transformation systemsTheoretical Computer Science, 1992
- The well-founded semantics for general logic programsJournal of the ACM, 1991