Simple polynomial groundness analysis for logic programs

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

doi:10.1016/S0743-1066(00)00006-6

Simple polynomial groundness analysis for logic programs

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

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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 (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 language	English
Pages (from-to)	143-156
Number of pages	14
Journal	Journal of Logic Programming
Volume	45
Issue number	1
DOIs	https://doi.org/10.1016/S0743-1066(00)00006-6
State	Published - 1 Jan 2000
Externally published	Yes

Access to Document

10.1016/S0743-1066(00)00006-6

Cite this

@article{f8222d421aed4443ba48b372148b1a6c,

title = "Simple polynomial groundness analysis for logic programs",

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 (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.",

author = "Andy Heaton and Muhamed Abo-Zaed and Michael Codish and Andy King",

note = "Funding Information: We would like to thank Florence Benoy, Pat Hill and Cohavit Taboch for discussions, Peter Schachte for help with the ROBDD comparison and Roberto Bagnara and the other reviewers of this paper for their useful comments. This work was funded, in part, by the UK ESPRC Grants GR/MO5645 and GR/MO8769 and by the Israel Science Foundation. Much of the work was carried out while Andy Heaton was visiting Ben-Gurion University.",

year = "2000",

month = jan,

day = "1",

doi = "10.1016/S0743-1066(00)00006-6",

language = "English",

volume = "45",

pages = "143--156",

journal = "Journal of Logic Programming",

issn = "0743-1066",

publisher = "Elsevier BV",

number = "1",

}

TY - JOUR

T1 - Simple polynomial groundness analysis for logic programs

AU - Heaton, Andy

AU - Abo-Zaed, Muhamed

AU - Codish, Michael

AU - King, Andy

N1 - Funding Information: We would like to thank Florence Benoy, Pat Hill and Cohavit Taboch for discussions, Peter Schachte for help with the ROBDD comparison and Roberto Bagnara and the other reviewers of this paper for their useful comments. This work was funded, in part, by the UK ESPRC Grants GR/MO5645 and GR/MO8769 and by the Israel Science Foundation. Much of the work was carried out while Andy Heaton was visiting Ben-Gurion University.

PY - 2000/1/1

Y1 - 2000/1/1

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

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

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

U2 - 10.1016/S0743-1066(00)00006-6

DO - 10.1016/S0743-1066(00)00006-6

M3 - Article

AN - SCOPUS:0034270056

VL - 45

SP - 143

EP - 156

JO - Journal of Logic Programming

JF - Journal of Logic Programming

SN - 0743-1066

IS - 1

ER -

Simple polynomial groundness analysis for logic programs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this