Heaton, A. and Abo-Zaed, M. and Codish, M. and King, A. (2000) A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming, 45 (1-3). pp. 143-156. ISSN 0743-1066.
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, a Pos analysis can never come with any efficiency guarantees because of its potential exponential behaviour. This paper considers groundness analysis based on a simple subdomain of Pos and compares its precision with that of Pos.
|Uncontrolled keywords:||groundness analysis; positive Boolean functions|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||12 Sep 2009 15:59|
|Last Modified:||06 Sep 2011 04:09|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21958 (The current URI for this page, for reference purposes)|
- Depositors only (login required):