Basic transformation operations which preserve computed answer substitutions of logic programs

DOI10.1016/0743-1066(93)90023-AMaRDI QIDQ5286917zbMATH OpenFDO

Authors Annalisa Bossi, Nicoletta Cocco

Publication date 13 January 1994

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)90023-A

zbMATH Keywords

fatteningpruningrestrictingS-semanticsthinningtransformation techniques for logic programsunfolding

Mathematics Subject Classification ID

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

Recommendations

• Supporting Transformations for the Partial Evaluation of Logic Programs
• scientific article; zbMATH DE number 440117
• scientific article; zbMATH DE number 1534593
• Transformations of logic programs with goals as arguments

Cited in

(32)

• S-semantics for logic programming: a retrospective look
• On the transformation of logic programs with instantiation based computation rules
• Transforming constraint logic programs
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• A compositional semantics for logic programs
• Linearisability on Datalog programs
• Rules + strategies for transforming lazy functional logic programs
• Totally correct logic program transformations via well-founded annotations
• scientific article; zbMATH DE number 1615256 (Why is no real title available?)
• Unfold/fold transformations for disjunctive logic programs
• scientific article; zbMATH DE number 440117 (Why is no real title available?)
• scientific article; zbMATH DE number 3890698 (Why is no real title available?)
• The transformational approach to program development
• scientific article; zbMATH DE number 4106263 (Why is no real title available?)
• scientific article; zbMATH DE number 1222414 (Why is no real title available?)
• Supporting Transformations for the Partial Evaluation of Logic Programs
• scientific article; zbMATH DE number 549994 (Why is no real title available?)
• scientific article; zbMATH DE number 1508931 (Why is no real title available?)
• scientific article; zbMATH DE number 1534593 (Why is no real title available?)
• scientific article; zbMATH DE number 1926606 (Why is no real title available?)
• Transformations of logic programs with goals as arguments
• Simultaneous Replacement in Normal Programs
• scientific article; zbMATH DE number 1420816 (Why is no real title available?)
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• Predicate Introduction Under Stable and Well-Founded Semantics
• Transformations of logic programs
• On transformations into linear database logic programs
• Transformations of CLP modules
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Logical query optimization by proof-tree transformation
• Preservation of stronger equivalence in unfold/fold logic program transformation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286917)