Precise and Efficient Groundness Analysis for Logic Programs

Kim Marriott, Harald Søndergaard

Research output: Contribution to journalArticleResearchpeer-review

74 Citations (Scopus)


We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as “approximations” to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the positive functions, is more suitable than others. Positive Boolean functions have a certain property which we 1993 call “condensation.” This property allows for rapid computation of groundness information.

Original languageEnglish
Pages (from-to)181-196
Number of pages16
JournalACM Letters on Programming Languages and Systems
Issue number1-4
Publication statusPublished - 3 Jan 1993


  • abstract interpretation
  • condensation
  • groundness analysis
  • propositional logic

Cite this