Unfold/fold transformation of stratified programs

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

Hirohisa Seki

Publication date: 26 June 1992

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

zbMATH Keywords

unfold/fold transformation; finite failure set; perfect model semantics

Mathematics Subject Classification ID

68N17: Logic programming

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item