Magic templates: a spellbinding approach to logic programs

DOI10.1016/0743-1066(91)90026-LMaRDI QIDQ3988795zbMATH OpenFDO

Authors Raghu Ramakrishnan

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1016/0743-1066(91)90026-L

zbMATH Keywords

binding-passingmagic programsmagic templatessideways information- passing

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Abstract interpretation of logic programs using magic transformations
• scientific article; zbMATH DE number 5079838
• Semantics of templates in a compositional framework for building logics
• scientific article; zbMATH DE number 5199142
• Magic sets for disjunctive Datalog programs
• scientific article; zbMATH DE number 1023017
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Dynamic magic sets for disjunctive Datalog programs

Cited in

(25)

• Binding propagation beyond the reach of rule/goal graphs
• On universal magic
• Bottom-up abstract interpretation of logic programs
• Magic sets revisited
• State-saving transformations for efficient bottom-up evaluation of logic programs and rule-based systems
• Loop checking in SLD-derivations by well-quasi-ordering of goals
• scientific article; zbMATH DE number 1696854 (Why is no real title available?)
• Comparison of methods for logic-query implementation
• Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
• Compilation of set terms in the logic data language (LDL)
• Abstract interpretation based on Alexander Templates
• scientific article; zbMATH DE number 549958 (Why is no real title available?)
• Magic sets with full sharing
• Decomposition of magic rewriting
• An analysis of magic sets and related optimization strategies for logic queries
• scientific article; zbMATH DE number 219225 (Why is no real title available?)
• scientific article; zbMATH DE number 1926633 (Why is no real title available?)
• Efficient goal directed bottom-up evaluation of logic programs
• A simple correctness proof for magic transformation
• Magically constraining the inverse method using dynamic polarity assignment
• Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving
• Pushing constraint selections
• scientific article; zbMATH DE number 5199142 (Why is no real title available?)
• Argument reduction by factoring
• Abstract interpretation: a kind of magic

This page was built for publication: Magic templates: a spellbinding approach to logic programs

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