Higher-precision groundness analysis

DOI10.1007/3-540-45635-X_17MaRDI QIDQ4736509zbMATH OpenFDO

Authors Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2237/22370135.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A simple polynomial groundness analysis for logic programs
• Logical optimality of groundness analysis
• Parameterizing a groundness analysis of logic programs
• Worst-case groundness analysis using positive Boolean functions
• Optimal groundness analysis using propositional logic

Cited in

(7)

• Logical optimality of groundness analysis
• Typed static analysis: Application to groundness analysis of PROLOG and PROLOG
• Optimal groundness analysis using propositional logic
• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
• Worst-case groundness analysis using definite Boolean functions
• A simple polynomial groundness analysis for logic programs
• Parameterizing a groundness analysis of logic programs

This page was built for publication: Higher-precision groundness analysis

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