Positive Boolean functions as multiheaded clauses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2237, Issue , 2001, Pages 120-134

  Howe, Jacob M ^a   King, Andy ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

(Constraint) logic programs; Abstract interpretation; Boolean functions; Groundness analysis

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER CIRCUITS; PROLOG (PROGRAMMING LANGUAGE);

ABSTRACT INTERPRETATIONS; BENCHMARK SUITES; COMPLEX OPERATIONS; GROUNDNESS; HORN CLAUSE; LOGIC PROGRAMS; POSITIVE BOOLEAN FUNCTION;

LOGIC PROGRAMMING;

EID: 84937215509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_16     Document Type: Conference Paper

References (24)

1. T. Armstrong, K. Marriott, P. Sc hachte, and H. Sondergaard. Two Classes of Boolean Functions for Dependency Analysis. Science of Computer Programming, 31(1):3–45, 1998.
2. R. Bagnara and P. Schachte. Factorizing Equivalent Variable Pairs in ROBDD Based Implementations of Pos. In Seventh International Conference on Algebraic Methodology and Software Technology, volume 1548 of Lecture Notes in Computer Science, pages 471–485.Springer-Verlag, 1999.
3. P. Bigot, S. Debray, and K. Marriott. Understanding Finiteness Analysis using Abstract Interpretation. In Joint International Conference and Symposium on Logic Programming, pages 735–749.MIT Press, 1992.
4. F. Bueno, D. Cabeza, M. Hermenegildo, and G. Puebla. Global Analysis of Standard Prolog Programs. In European Symposium on Programming, volume 1058 of Lecture Notes in Computer Science, pages 108–124.Springer-Verlag, 1996.
5. M. Codish. Efficient Goal Directed Bottom-up Evaluation of Logic Programs. Journal of Logic Programming, 38(3):355–370, 1999.
6. M. Codish. Worst-Case Groundness Analysis using Positive Boolean Functions. Journal of Logic Programming, 41(1):125–128, 1999.
7. M. Co dish and B. Demo en. Analysing Logic Programs using “prop”-ositional Logic Programs and a Magic Wand. Journal of Logic Programming, 25(3):249–274, 1995.
8. M. Codish, H. Sondergaard, and P. Stuckey. Sharing and Groundness Dependencies in Logic Programs. ACM Transactions on Programming Languages and Systems, 21(5):948–976, 1999.
9. P. Dart. On Derived Dependencies and Connected Databases. Journal of Logic Programming, 11(1–2):163–188, 1991.
10. C. Fecht. Abstrakte Interpretation logischer Programme: Theorie, Implementierung, Generierung. PhD thesis, Universitat des Saarlandes, 1997.
11. C. Fecht and H. Seidl. A Faster Solver for General Systems of Equations. Science of Computer Programming, 35(2-3):137–162, 1999.
12. M. Garcìa de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 18(5):564–614, 1996.
13. S. Genaim and M. Codish. The Definite Approach to Dependency Analysis. In European Symposium on Programming, volume 2028 of Lecture Notes in Computer Science, pages 417–32.Springer-Verlag, 2001.
14. S. Genaim, J.M. Ho we, and M. Co dish. Worst-Case Groundness Analysis using Definite Boolean Functions. Theory and Practice of Logic Programming, 2001. Forthcoming.
15. R. Giacobazzi, S. Debra y, and G. Levi. Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. Journal of Logic Programming, 25(3):191–247, 1995.
16. R. Giacobazzi and F. Scozzari. A Logical Model for Relational Abstract Domains. ACM Transactions on Programming Languages and Systems, 20(5):1067–1109, 1998.
17. A. Heaton, M. Abo Zaed, M. Co dish, and A. King. A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming, 45(1–3):143–156, 2000.
18. M. Hermenegildo, G. Puebla, K. Marriot, and P. Stuc key. Incremental Analysis of Constraint Logic Programs. ACM Transaction on Programming Languages and Systems, 22(2):187–223, 2000.
19. J.M. Ho we and A. King. Implementing Groundness Analysis with Definite Boolean Functions. In European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 200–214.Springer-Verlag, 2000. Available at http://www.cs.ukc.ac.uk/pubs/2000/949/.
20. A. King and L. Lu. A Backwards Analysis for Constraint Logic Programs. Technical Report 4-01, University of Kent, 2001.
21. K. Marriott and H. Sondergaard. Precise and Efficient Groundness Analysis for Logic Programs. ACM Letters on Programming Languages and Systems, 2(4):181–196, 1993.
22. G. Plotkin. A Note on Inductive Generalisation. Machine Intelligence, 5:153–163, 1970.
23. P. Schachte.: Precise and Efficient Static Analysis of Logic Programs. PhD thesis, Department of Computer Science, The University of Melbourne, Australia, 1999.
24. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Evaluation of the Domain Prop. Journal of Logic Programming, 23(3):237–278, 1995.