© University of Kent - Contact | Feedback | Legal | FOI | Cookies
A Simple Polynomial Groundness Analysis for Logic Programs
A. Heaton, M. Abo-Zaed, M. Codish, and A. King
Journal of Logic Programming, 45:182-196, September 2000.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.
Download publication 208 kbytes (PostScript)Bibtex Record
@article{955,
author = {A.~Heaton and M.~Abo-Zaed and M.~Codish and A.~King},
title = {A {S}imple {P}olynomial {G}roundness {A}nalysis for {L}ogic {P}rograms},
month = {September},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/955},
ISSN = {0743-1066},
Issue = {1-3},
Volume = {45},
journal = {Journal of Logic Programming},
publication_type = {article},
publisher = {Elsevier},
submission_id = {6311_947861057},
}