Simple polynomial groundness analysis for logic programs

Journal of Logic Programming

Volumn 45, Issue 1, 2000, Pages 143-156

  Heaton, Andy ^d   Abo Zaed, Muhamed ^a   Codish, Michael ^b   King, Andy ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITY OF KENT   (United Kingdom)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DECISION TABLES; EQUIVALENCE CLASSES; PROGRAM COMPILERS; PROLOG (PROGRAMMING LANGUAGE);

BINARY DECISION DIAGRAMS; POSITIVE BOOLEAN FUNCTIONS; REDUCED ORDER BINARY DECISION DIAGRAMS;

LOGIC PROGRAMMING;

EID: 0034270056     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(00)00006-6     Document Type: Article

References (23)

1. T. Armstrong, K. Marriott, P. Schachte, H. Søslashndergaard, Two classes of Boolean functions for dependency analysis, Science of Computer Programming 31 (1) (1998) 3-45.
2. R. Bagnara, P. Schachte, Factorizing equivalent variable pairs in ROBDD-based implementations of Pos, in: Proceedings of the Seventh International Conference on Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, vol. 1548, Springer, Berlin, 1999, pp. 471-485.
3. M. Bruynooghe, A practical framework for the abstract interpretation of logic programs, The Journal of Logic Programming 10 (2) (1991) 91-124.
4. M. Codish, Efficient goal directed bottom-up evaluation of logic programs, The Journal of Logic Programming 38 (3) (1999) 354-370.
5. M. Codish, Worst-case groundness analysis using positive Boolean functions, The Journal of Logic Programming 41 (1999) 125-128.
6. M. Codish, B. Demoen, Analysing logic programs using "prop"-ositional logic programs and a magic wand, The Journal of Logic Programming 25 (3) (1995) 249-274.
7. M.-M. Corsini, K. Musumbu, A. Rauzy, B. LeCharlier, Efficient bottom-up abstract interpretation of prolog by means of Constraint Solving over finite domains, in: Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, vol. 714, Springer, Berlin, 1993, pp. 75-91.
8. A. Cortesi, G. Filé, W. Winsborough, Optimal groundness analysis using propositional logic, The Journal of Logic Programming 27 (2) (1996) 137-168.
9. P. Dart, On derived dependencies and connected databases, The Journal of Logic Programming 11 (2) (1991) 163-188.
10. S. Dawson, C.R. Ramakrishnan, D.S. Warren, Practical program analysis using general purpose logic programming systems - a case study, in: Programming Language Design and Implementation, ACM Press, 1996, pp. 117-126.
11. S. Debray, D.S. Warren, Automatic mode inference for logic programs, The Journal of Logic Programming 5 (1988) 207-229.
12. C. Fecht, Abstrakte Interpretation logischer Programme: Theorie Implementierung Generierung, Ph.D. Thesis, Universität des Saarlandes, 1997.
13. C. Fecht, Personal communication on Pos, DCGs and largearity predicates, November 1997.
14. M. Garcí de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, W. Simoens, Global analysis of constraint logic programs, ACM TOPLAS 18 (5) (1996) 564-614.
15. N. Jones, H. Søndergaard A semantics-based framework for the abstract interpretation of prolog, in: Abstract Interpretation of Declarative Languages, Ellis Horwood Limited, 1987, pp. 123-142.
16. B. Le Charlier, P. Van Hentenryck, Reexecution in abstract interpretation of prolog, Acta Informatica 32 (1995) 209-253.
17. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Letters Programming and Language Systems 2 (4) (1993) 181-196.
18. C. Mellish, Abstract interpretation of prolog programs, in: Third International Conference on Logic Programming, Lecture Notes in Computer Science, vol. 225, Springer, Berlin, 1986, pp. 463-474.
19. G. Plotkin, A note on inductive generalisation, Machine Intelligence 5 (1970) 153-163.
20. P. Schachte, Precise and efficient static analysis of logic programs, Ph.D. Thesis, Department of Computer Science, The University of Melbourne, Melbourne, Australia, 1999.
21. P. Van Hentenryck, A. Cortesi, B. Le Charlier, Evaluation of the domain prop, The Journal of Logic Programming 23 (3) (1995) 237-278.
22. P. Van Hentenryck, O. Degimbe, B. LeCharlier, L. Michel, The impact of granularity in abstract interpretation of prolog, in: Proceedings of the Workshop on Static Analysis, Lecture Notes in Computer Science, vol. 724, Springer, Berlin, 1993, pp. 1-14.
23. J. Wunderwald, Memoing evaluation by source-to-source transformation, in: Fifth International Workshop on Logic Program Synthesis and Transformation, Lecture Notes in Computer Science, vol. 1048, Springer, Berlin, 1995, pp. 17-32.