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://openaccess.city.ac.uk/id/eprint/1701/5/Efficient_groundness_analysis_in_Prolog.pdf

zbMATH Keywords

abstract interpretationdefinite Boolean functionsfix-point algorithms.groundness analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Implementing groundness analysis with definite Boolean functions
• A simple polynomial groundness analysis for logic programs
• Two classes of Boolean functions for dependency analysis
• Parameterizing a groundness analysis of logic programs
• The Def-inite approach to dependency analysis

Cited in

(16)

• Two classes of Boolean functions for dependency analysis
• The Def-inite approach to dependency analysis
• 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
• Implementing groundness analysis with definite Boolean functions
• Efficient algebraic effect handlers for Prolog
• Positive Boolean functions as multiheaded clauses
• Parameterizing a groundness analysis of logic programs
• 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)