Preservation of stronger equivalence in unfold/fold logic program transformation

DOI10.1016/0304-3975(90)90065-PzbMath0702.68080OpenAlexW2001937661MaRDI QIDQ915479

Tadashi Kanamori, Tadashi Kawamura

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90065-p

zbMATH Keywords

program transformationlogic programsprogram equivalenceleast Herbrand modelunfold/fold transformation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (8)

Unfold/fold transformations for disjunctive logic programs ⋮ Linearisability on Datalog programs ⋮ Rules + strategies for transforming lazy functional logic programs ⋮ Preservation of stronger equivalence in unfold/fold logic program transformation ⋮ Unfold/fold transformation of stratified programs ⋮ Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs ⋮ Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding ⋮ Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

Cites Work

• Preservation of stronger equivalence in unfold/fold logic program transformation
• Synthesis: Dreams → Programs
• A Transformation System for Developing Recursive Programs
• Unnamed Item

This page was built for publication: Preservation of stronger equivalence in unfold/fold logic program transformation