Worst-case groundness analysis using definite Boolean functions

Theory and Practice of Logic Programming

Volumn 1, Issue 5, 2001, Pages 611-615

  Genaim, Samir ^a   Codish, Michael ^a   Howe, Jacob M ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344183346     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401001077     Document Type: Article

References (5)

1. Bryant, R. (1992) Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3), 293-318.
2. Codish, M. (1999) Worst-case groundness analysis using positive Boolean functions. J. Logic Programming, 41(1), 125-128.
3. Howe, J. M. and King, A. (2000) Implementing groundness analysis with definite Boolean functions. In: Smolka, G. (ed.), European symposium on programming: Lecture Notes in Computer Science 1782, pp. 200-214. Springer-Verlag.
4. King, A., Smaus, J.-G. and Hill, P. (1999) Quotienting share for dependency analysis. In: Swierstra, D. (ed.), European symposium on programming: Lecture Notes in Computer Science 1576, pp. 59-73. Springer-Verlag.
5. Van Hentenryck, P., Cortesi, A. and Le Charlier, B. (1995) Evaluation of the domain Prop. J. Logic Programming, 23(3), 237-278.