Heaton, Andrew, Abo-Zaed, Mohammad, King, Andy, Micheal, Codish (2000) A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming, 45 (1-3). pp. 143-156. ISSN 0743-1066. (doi:10.1016/S0743-1066(00)00006-6) (KAR id:37583)
PDF
Publisher pdf
Language: English |
||
Download (518kB)
Preview
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
Official URL http://dx.doi.org/10.1016/S0743-1066(00)00006-6 |
Abstract
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.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1016/S0743-1066(00)00006-6 |
Subjects: | A General Works |
Divisions: | Faculties > Sciences > School of Computing > Programming Languages and Systems Group |
Depositing User: | Andy King |
Date Deposited: | 12 Dec 2013 20:24 UTC |
Last Modified: | 15 Feb 2020 04:05 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/37583 (The current URI for this page, for reference purposes) |
King, Andy: | ![]() |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):