Basic transformation operations which preserve computed answer substitutions of logic programs

DOI10.1016/0743-1066(93)90023-AzbMath0778.68020MaRDI QIDQ5286917

Nicoletta Cocco, Annalisa Bossi

Publication date: 13 January 1994

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

zbMATH Keywords

thinningpruningunfoldingfatteningrestrictingS-semanticstransformation techniques for logic programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (10)

Unfold/fold transformations for disjunctive logic programs ⋮ Linearisability on Datalog programs ⋮ Rules + strategies for transforming lazy functional logic programs ⋮ Transformations of CLP modules ⋮ Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs ⋮ Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding ⋮ Transforming constraint logic programs ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ S-semantics for logic programming: a retrospective look ⋮ A compositional semantics for logic programs

This page was built for publication: Basic transformation operations which preserve computed answer substitutions of logic programs