A simple polynomial groundness analysis for logic programs

DOI10.1016/S0743-1066(00)00006-6MaRDI QIDQ4507857zbMATH OpenOpenAlexWikidataFDO

Authors Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King

Publication date 10 October 2000

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

Full work available at URL https://doi.org/10.1016/s0743-1066(00)00006-6

zbMATH Keywords

positive Boolean functionsPos

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Efficient groundness analysis in Prolog
• scientific article; zbMATH DE number 1538027
• scientific article; zbMATH DE number 2085274
• Two classes of Boolean functions for dependency analysis
• scientific article; zbMATH DE number 2085273

Cited in

(8)

• Efficient groundness analysis in Prolog
• scientific article; zbMATH DE number 2084361 (Why is no real title available?)
• scientific article; zbMATH DE number 1832222 (Why is no real title available?)
• Worst-case groundness analysis using definite Boolean functions
• scientific article; zbMATH DE number 2085273 (Why is no real title available?)
• Abstracting numeric constraints with Boolean functions
• scientific article; zbMATH DE number 1692955 (Why is no real title available?)
• scientific article; zbMATH DE number 2085274 (Why is no real title available?)

This page was built for publication: A simple polynomial groundness analysis for logic programs

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