Unfold/fold transformations of logic programs

DOI10.1017/S0960129500001419MaRDI QIDQ4015152zbMATH OpenFDO

Authors John Shepherdson

Publication date 14 December 1992

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

Full work available at URL https://doi.org/10.1017/S0960129500001419

zbMATH Keywords

foldingunfoldingcomplementationdeclarative semanticsleast Herbrand modelfinite failure setsame success set

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• Derivation of Logic Programs
• Knowledge and reasoning in program synthesis
• Synthesis: Dreams → Programs

Cited in

(13)

• Unfold/fold transformation of stratified programs
• Equivalence-preserving first-order unfold/fold transformation systems
• scientific article; zbMATH DE number 936828 (Why is no real title available?)
• Preservation of stronger equivalence in unfold/fold logic program transformation
• scientific article; zbMATH DE number 3924119 (Why is no real title available?)
• scientific article; zbMATH DE number 850634 (Why is no real title available?)
• An equivalence preserving first order unfold/fold transformation system
• scientific article; zbMATH DE number 176531 (Why is no real title available?)
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• scientific article; zbMATH DE number 4164123 (Why is no real title available?)
• Transformations of CLP modules
• Fold/unfold transformations for fixpoint logic
• How powerful are folding/unfolding transformations?

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)