Unfold/fold transformation of stratified programs

DOI10.1016/0304-3975(91)90007-OzbMath0737.68016OpenAlexW1975952423MaRDI QIDQ1177929

Hirohisa Seki

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90007-o

zbMATH Keywords

unfold/fold transformationfinite failure setperfect model semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Linearisability on Datalog programs, Generalization strategies for the verification of infinite state systems, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Constraint-based correctness proofs for logic program transformations, Unnamed Item, Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, Transformations of CLP modules, Transformations of logic programs on infinite lists, Totally correct logic program transformations via well-founded annotations, Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Preservation of stronger equivalence in unfold/fold logic program transformation
• A completeness theorem for SLDNF resolution
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• An Efficient Unification Algorithm
• Unfold/fold transformations of logic programs
• A Machine-Oriented Logic Based on the Resolution Principle