Worst-case groundness analysis using positive Boolean functions

DOI10.1016/S0743-1066(99)00014-XMaRDI QIDQ4719376zbMATH OpenOpenAlexFDO

Authors Michael Codish

Publication date 4 January 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(99)00014-x

zbMATH Keywords

Boolean functionsgroundness analyses

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Worst-case groundness analysis using definite Boolean functions
• scientific article; zbMATH DE number 1538027
• Logical optimality of groundness analysis
• Optimal groundness analysis using propositional logic
• scientific article; zbMATH DE number 5064780
• Probabilistic verification of Boolean functions
• Analysis of Boolean Programs
• Analysis of affinely equivalent Boolean functions
• Positive and negative proofs for circuits and branching programs
• Positive and negative proofs for circuits and branching programs

Cited in

(5)

• Abstracting numeric constraints with Boolean functions
• UN-KLEENE BOOLEAN EQUATION SOLVING
• Worst-case groundness analysis using definite Boolean functions
• scientific article; zbMATH DE number 1538027 (Why is no real title available?)
• scientific article; zbMATH DE number 2085274 (Why is no real title available?)

This page was built for publication: Worst-case groundness analysis using positive Boolean functions

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