Unfold/fold transformations of logic programs

DOI10.1017/S0960129500001419zbMATH Open0749.68021MaRDI QIDQ4015152FDOQ4015152

Authors: John Shepherdson 

Publication date: 14 December 1992

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• Unfold/fold transformation of stratified programs
• scientific article; zbMATH DE number 3924119
• Preservation of stronger equivalence in unfold/fold logic program transformation

zbMATH Keywords

foldingunfoldingcomplementationdeclarative semanticsleast Herbrand modelfinite failure setsame success set

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• A Transformation System for Developing Recursive Programs
• Synthesis: Dreams → Programs
• Knowledge and reasoning in program synthesis
• Derivation of Logic Programs

Cited In (12)

• Unfold/fold transformation of stratified programs
• Equivalence-preserving first-order unfold/fold transformation systems
• Title not available (Why is that?)
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Title not available (Why is that?)
• Title not available (Why is that?)
• An equivalence preserving first order unfold/fold transformation system
• Title not available (Why is that?)
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• Title not available (Why is that?)
• Transformations of CLP modules
• Fold/unfold transformations for fixpoint logic

This page was built for publication: Unfold/fold transformations of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015152)