Unfold⧸fold transformation of general logic programs for the well-founded semantics

DOI10.1016/0743-1066(93)90021-8MaRDI QIDQ5286915zbMATH OpenOpenAlexFDO

Authors Hirohisa Seki

Publication date 25 August 1993

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(93)90021-8

zbMATH Keywords

well-founded semanticsunfold/fold transformationequivalence of programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On the correctness of unfold/fold transformation of normal and extended logic programs
• Unfold/fold transformations of logic programs
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• scientific article; zbMATH DE number 1487848
• Unfold/fold transformation of stratified programs

Cited in

(14)

• Transformation-based bottom-up computation of the well-founded model
• Inverse Unfold Problem and Its Heuristic Solving
• Unfold/fold transformations for disjunctive logic programs
• scientific article; zbMATH DE number 936828 (Why is no real title available?)
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Determinization of conditional term rewriting systems
• A Generalization of the Folding Rule for the Clark-Kunen Semantics
• Linearisability on Datalog programs
• scientific article; zbMATH DE number 850634 (Why is no real title available?)
• Unfold/fold transformations of logic programs
• An analysis of the equational properties of the well-founded fixed point
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• scientific article; zbMATH DE number 2059537 (Why is no real title available?)
• Transformations of CLP modules

This page was built for publication: Unfold⧸fold transformation of general logic programs for the well-founded semantics

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