Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

DOI10.1016/S0747-7171(06)80003-9MaRDI QIDQ1322838zbMATH OpenOpenAlexFDO

Authors Dmitri Boulanger, Maurice Bruynooghe

Publication date 9 May 1994

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0747-7171(06)80003-9

zbMATH Keywords

logic programsOLDT resolutionfold/unfold transformation

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Unfold/fold transformations of logic programs
• scientific article; zbMATH DE number 1487848
• scientific article; zbMATH DE number 440117
• Unfold⧸fold transformation of general logic programs for the well-founded semantics

Cites work

• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 4047053 (Why is no real title available?)
• scientific article; zbMATH DE number 25188 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 177791 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 549961 (Why is no real title available?)
• scientific article; zbMATH DE number 194907 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A linear-time algorithm for finding all feedback vertices
• Abstract interpretation based on oldt resolution
• Compiling bottom-up and mixed derivations into top-down executable logic programs
• Compiling control
• Declarative modeling of the operational behavior of logic languages
• Most specific logic programs
• Partial evaluation in logic programming
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Recursive query processing: The power of logic
• Specialisation of Prolog and FCP programs using abstract interpretation
• Termination proofs for logic programs
• Unfold/fold transformation of stratified programs

This page was built for publication: Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

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