Worst-case groundness analysis using positive Boolean functions
From MaRDI portal
Recommendations
- Worst-case groundness analysis using definite Boolean functions
- Implementing groundness analysis with definite Boolean functions
- 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)
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)