Precise and Efficient Groundness Analysis for Logic Programs (1993)
| Venue: | ACM LETTERS ON PROGRAMMING LANGUAGES AND SYSTEMS |
| Citations: | 52 - 3 self |
BibTeX
@ARTICLE{Marriott93preciseand,
author = {Kim Marriott and Harald Søndergaard},
title = {Precise and Efficient Groundness Analysis for Logic Programs},
journal = {ACM LETTERS ON PROGRAMMING LANGUAGES AND SYSTEMS},
year = {1993},
volume = {2},
pages = {1--4}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 (inspired by A. Langen) call "condensation." This property allows for rapid computation of groundness information.
