A simple polynomial groundness analysis for logic programs
Publication type: Journal Article
Publication date: 2000-09-01
Logic
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 .
Found
Nothing found, try to update filter.
Found
Nothing found, try to update filter.
Top-30
Journals
|
1
2
3
4
5
6
|
|
|
Lecture Notes in Computer Science
6 publications, 75%
|
|
|
Information Processing Letters
1 publication, 12.5%
|
|
|
Theory and Practice of Logic Programming
1 publication, 12.5%
|
|
|
1
2
3
4
5
6
|
Publishers
|
1
2
3
4
5
6
|
|
|
Springer Nature
6 publications, 75%
|
|
|
Elsevier
1 publication, 12.5%
|
|
|
Cambridge University Press
1 publication, 12.5%
|
|
|
1
2
3
4
5
6
|
- We do not take into account publications without a DOI.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
8
Total citations:
8
Citations from 2024:
0
Cite this
GOST |
RIS |
BibTex |
MLA
Cite this
GOST
Copy
Heaton A. et al. A simple polynomial groundness analysis for logic programs // The Journal of Logic Programming. 2000. Vol. 45. No. 1-3. pp. 143-156.
GOST all authors (up to 50)
Copy
Heaton A., Abo-Zaed M., Codish M., King A. A simple polynomial groundness analysis for logic programs // The Journal of Logic Programming. 2000. Vol. 45. No. 1-3. pp. 143-156.
Cite this
RIS
Copy
TY - JOUR
DO - 10.1016/s0743-1066(00)00006-6
UR - https://doi.org/10.1016/s0743-1066(00)00006-6
TI - A simple polynomial groundness analysis for logic programs
T2 - The Journal of Logic Programming
AU - Heaton, Andy
AU - Abo-Zaed, Muhamed
AU - Codish, Michael
AU - King, Andy
PY - 2000
DA - 2000/09/01
PB - Elsevier
SP - 143-156
IS - 1-3
VL - 45
SN - 0743-1066
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2000_Heaton,
author = {Andy Heaton and Muhamed Abo-Zaed and Michael Codish and Andy King},
title = {A simple polynomial groundness analysis for logic programs},
journal = {The Journal of Logic Programming},
year = {2000},
volume = {45},
publisher = {Elsevier},
month = {sep},
url = {https://doi.org/10.1016/s0743-1066(00)00006-6},
number = {1-3},
pages = {143--156},
doi = {10.1016/s0743-1066(00)00006-6}
}
Cite this
MLA
Copy
Heaton, Andy, et al. “A simple polynomial groundness analysis for logic programs.” The Journal of Logic Programming, vol. 45, no. 1-3, Sep. 2000, pp. 143-156. https://doi.org/10.1016/s0743-1066(00)00006-6.