Simple polynomial groundness analysis for logic programs

Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


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 (BDDs) 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.

Original languageEnglish
Pages (from-to)143-156
Number of pages14
JournalJournal of Logic Programming
Issue number1
StatePublished - 1 Jan 2000
Externally publishedYes

ASJC Scopus subject areas

  • Logic


Dive into the research topics of 'Simple polynomial groundness analysis for logic programs'. Together they form a unique fingerprint.

Cite this