A simple polynomial groundness analysis for logic programs
From MaRDI portal
Recommendations
Cited in
(9)- Two classes of Boolean functions for dependency analysis
- The Def-inite approach to dependency analysis
- Abstracting numeric constraints with Boolean functions
- Efficient groundness analysis in Prolog
- Worst-case groundness analysis using definite Boolean functions
- Pos( T): Analyzing dependencies in typed logic programs
- Positive Boolean functions as multiheaded clauses
- Higher-precision groundness analysis
- Parameterizing a groundness analysis of logic programs
This page was built for publication: A simple polynomial groundness analysis for logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507857)