Precise and Efficient Groundness Analysis for Logic Programs

Kim Marriott, Harald Søndergaard

Research output: Contribution to journalArticleResearchpeer-review

74 Citations (Scopus)

Abstract

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 (LOPLAS)
Volume2
Issue number1-4
DOIs
Publication statusPublished - 3 Jan 1993

Keywords

  • abstract interpretation
  • condensation
  • groundness analysis
  • propositional logic

Cite this

@article{5e8cb10ccc664238b58c760c066f3061,
title = "Precise and Efficient Groundness Analysis for Logic Programs",
abstract = "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.",
keywords = "abstract interpretation, condensation, groundness analysis, propositional logic",
author = "Kim Marriott and Harald S{\o}ndergaard",
year = "1993",
month = "1",
day = "3",
doi = "10.1145/176454.176519",
language = "English",
volume = "2",
pages = "181--196",
journal = "ACM Letters on Programming Languages and Systems (LOPLAS)",
issn = "1057-4514",
number = "1-4",

}

Precise and Efficient Groundness Analysis for Logic Programs. / Marriott, Kim; Søndergaard, Harald.

In: ACM Letters on Programming Languages and Systems (LOPLAS), Vol. 2, No. 1-4, 03.01.1993, p. 181-196.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Precise and Efficient Groundness Analysis for Logic Programs

AU - Marriott, Kim

AU - Søndergaard, Harald

PY - 1993/1/3

Y1 - 1993/1/3

N2 - 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.

AB - 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.

KW - abstract interpretation

KW - condensation

KW - groundness analysis

KW - propositional logic

UR - http://www.scopus.com/inward/record.url?scp=0027569243&partnerID=8YFLogxK

U2 - 10.1145/176454.176519

DO - 10.1145/176454.176519

M3 - Article

VL - 2

SP - 181

EP - 196

JO - ACM Letters on Programming Languages and Systems (LOPLAS)

JF - ACM Letters on Programming Languages and Systems (LOPLAS)

SN - 1057-4514

IS - 1-4

ER -