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

DOI10.1016/0743-1066(93)90021-8zbMATH Open0776.68031OpenAlexW1995270677MaRDI QIDQ5286915FDOQ5286915

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

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

zbMATH Keywords

well-founded semanticsunfold/fold transformationequivalence of programs

Mathematics Subject Classification ID

Logic programming (68N17)

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Linearisability on Datalog programs
• 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
• Title not available (Why is that?)
• 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)