BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS

DOI10.1142/S0129054102001175zbMath1066.68016OpenAlexW1973899735MaRDI QIDQ3021960

Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, K. Narayan Kumar

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001175

zbMATH Keywords

program transformationslogic programmingnormal logic programsunfold/fold transformations

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (6)

Determinization of conditional term rewriting systems ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Constraint-based correctness proofs for logic program transformations ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ On Inductive Proofs by Extended Unfold/Fold Transformation Rules ⋮ Transformations of logic programs on infinite lists

Cites Work

• Equivalence-preserving first-order unfold/fold transformation systems
• A transformation system for deductive database modules with perfect model semantics
• The well-founded semantics for general logic programs
• Simultaneous Replacement in Normal Programs

This page was built for publication: BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS