Automatic finite unfolding using well-founded measures

DOI10.1016/0743-1066(95)00149-2MaRDI QIDQ3129508zbMATH OpenOpenAlexFDO

Authors Bern Martens, Danny De Schreye

Publication date 9 June 1997

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

Full work available at URL https://lirias.kuleuven.be/handle/123456789/125403

zbMATH Keywords

logic programscontrol unfolding

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Sound and complete partial deduction with unfolding based on well-founded measures
• scientific article; zbMATH DE number 970704
• A general criterion for avoiding infinite unfolding during partial deduction
• Efficient local unfolding with ancestor stacks

Cited in

(7)

• A general criterion for avoiding infinite unfolding during partial deduction
• Type-based homeomorphic embedding for online termination
• Toward automating the discovery of decreasing measures
• Loop checks for logic programs with functions
• Efficient local unfolding with ancestor stacks
• A study on the practicality of poly-controlled partial evaluation
• Termination prediction for general logic programs

This page was built for publication: Automatic finite unfolding using well-founded measures

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