Optimal groundness analysis using propositional logic

DOI10.1016/0743-1066(95)00123-9MaRDI QIDQ3129500zbMATH OpenOpenAlexFDO

Authors Agostino Cortesi, Gilberto File, William Windsborough

Publication date 10 November 1997

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

Full work available at URL https://doi.org/10.1016/0743-1066(95)00123-9

zbMATH Keywords

abstract interpretationProp

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logical optimality of groundness analysis
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Evaluation of the domain prop
• scientific article; zbMATH DE number 2085274
• Efficient groundness analysis in Prolog

Cited in

(14)

• The quotient of an abstract interpretation
• Logical optimality of groundness analysis
• Pair-independence and freeness analysis through linear refinement.
• The powerset operator on abstract interpretations
• scientific article; zbMATH DE number 1696888 (Why is no real title available?)
• Information leakage analysis by abstract interpretation
• Evaluation of the domain prop
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Optimality in goal-dependent analysis of Sharing
• scientific article; zbMATH DE number 1538027 (Why is no real title available?)
• Worst-case groundness analysis using positive Boolean functions
• scientific article; zbMATH DE number 2085274 (Why is no real title available?)
• scientific article; zbMATH DE number 1832222 (Why is no real title available?)
• Operational semantics for reexecution-based analysis of logic programs with delay declarations

This page was built for publication: Optimal groundness analysis using propositional logic

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