scientific article; zbMATH DE number 1538027
From MaRDI portal
Publication:4518882
Recommendations
- Worst-case groundness analysis using definite Boolean functions
- Worst-case groundness analysis using positive Boolean functions
- Optimal groundness analysis using propositional logic
- Grounding and truth-functions
- Logical optimality of groundness analysis
- Analysis of Boolean Programs
- Analysis of affinely equivalent Boolean functions
- Analysis of Boolean Functions
- scientific article; zbMATH DE number 512939
- Efficient groundness analysis in Prolog
Cited in
(9)- Logic programs as compact denotations.
- Two classes of Boolean functions for dependency analysis
- scientific article; zbMATH DE number 1692955 (Why is no real title available?)
- Abstracting numeric constraints with Boolean functions
- Efficient groundness analysis in Prolog
- Worst-case groundness analysis using definite Boolean functions
- A simple polynomial groundness analysis for logic programs
- Worst-case groundness analysis using positive Boolean functions
- scientific article; zbMATH DE number 2085273 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518882)
