Codish, M. and Heaton, A. and King, A. and Abo-Zaed, M. and Hill, P.M.
Widening Positive Boolean functions for Goal-dependent Groundness Analysis.
University of Kent
(Full text available)
The domain of positive Boolean functions, Pos, is by now well established for the analysis of the variable dependencies that arise within logic programs. Analyses based on Pos that use binary decision diagrams have been shown to be efficient for a wide range of practical programs. However, independent of the representation, assuming that P neq NP, an (unwidened) Pos analysis can never come with any efficiency guarantees because of its potentially explosive behaviour. This paper proposes a simple widening for (goal-dependent) groundness analysis of logic programs that guarantees scalability and efficiency. Experimental results indicate that the widening induces only a very small loss of precision.
- Depositors only (login required):