Pages that link to "Item:Q5286917"

The following pages link to Basic transformation operations which preserve computed answer substitutions of logic programs (Q5286917):

Displaying 10 items.

• Unfold/fold transformations for disjunctive logic programs (Q287026) (← links)
• Transformations of CLP modules (Q671648) (← links)
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
• S-semantics for logic programming: a retrospective look (Q1035702) (← links)
• Transforming constraint logic programs (Q1274969) (← links)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
• A compositional semantics for logic programs (Q1314414) (← links)
• Linearisability on Datalog programs (Q1884881) (← links)
• Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
• Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding (Q5415653) (← links)