Efficient groundness analysis in Prolog

DOI10.1017/S1471068402001485MaRDI QIDQ4452593zbMATH OpenFDO

Authors Jacob M. Howe, Andy King

Publication date 1 March 2004

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068402001485

zbMATH Keywords

abstract interpretationdefinite Boolean functionsfix-point algorithms.groundness analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1538027
• A simple polynomial groundness analysis for logic programs
• Two classes of Boolean functions for dependency analysis
• scientific article; zbMATH DE number 1832222
• scientific article; zbMATH DE number 1692955

Cited in

(16)

• Two classes of Boolean functions for dependency analysis
• scientific article; zbMATH DE number 1692955 (Why is no real title available?)
• Abstracting numeric constraints with Boolean functions
• Boolean functions for finite-tree dependencies
• Dependency triples for improving termination analysis of logic programs with cut
• Evaluation of the domain prop
• Optimal groundness analysis using propositional logic
• scientific article; zbMATH DE number 512886 (Why is no real title available?)
• A pearl on SAT and SMT solving in Prolog
• Worst-case groundness analysis using definite Boolean functions
• A simple polynomial groundness analysis for logic programs
• scientific article; zbMATH DE number 1538027 (Why is no real title available?)
• Efficient algebraic effect handlers for Prolog
• scientific article; zbMATH DE number 2085273 (Why is no real title available?)
• scientific article; zbMATH DE number 1832222 (Why is no real title available?)
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog

This page was built for publication: Efficient groundness analysis in Prolog

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