Basic transformation operations which preserve computed answer substitutions of logic programs

DOI10.1016/0743-1066(93)90023-AzbMATH Open0778.68020MaRDI QIDQ5286917FDOQ5286917

Authors: Annalisa Bossi, Nicoletta Cocco 

Publication date: 13 January 1994

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

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

zbMATH Keywords

pruningunfoldingthinningrestrictingfatteningS-semanticstransformation techniques for logic programs

Mathematics Subject Classification ID

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

Cited In (28)

• Title not available (Why is that?)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Title not available (Why is that?)
• Transforming constraint logic programs
• Title not available (Why is that?)
• Supporting Transformations for the Partial Evaluation of Logic Programs
• On transformations into linear database logic programs
• The transformational approach to program development
• Unfold/fold transformations for disjunctive logic programs
• Title not available (Why is that?)
• Transformations of logic programs with goals as arguments
• Preservation of stronger equivalence in unfold/fold logic program transformation
• A compositional semantics for logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linearisability on Datalog programs
• S-semantics for logic programming: a retrospective look
• Transformations of logic programs
• Predicate Introduction Under Stable and Well-Founded Semantics
• Rules + strategies for transforming lazy functional logic programs
• Totally correct logic program transformations via well-founded annotations
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transformations of CLP modules
• On the transformation of logic programs with instantiation based computation rules
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Logical query optimization by proof-tree 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)