A local algorithm for incremental evaluation of tabled logic programs

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

Volumn 4079 LNCS, Issue , 2006, Pages 56-71

  Saha, Diptikalyan ^a   Ramakrishnan, C R ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA FLOW ANALYSIS; DATA REDUCTION; DATA TRANSFER; GRAPH THEORY; PROBLEM SOLVING;

DEPENDENCY GRAPH; FUNCTIONAL PROGRAMS; LOCAL ALGORITHM; MEMO TABLES;

LOGIC PROGRAMMING;

EID: 33749366200     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799573_7     Document Type: Conference Paper

References (34)

1. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. In POPL, pages 247-259. ACM Press, 2002.
2. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: principles, techniques, and tools, pages 585-718. Addison-Wesley, 1986.
3. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Symposium on Discrete algorithms, pages 32-42, 1990.
4. R. Bol and L. Degerstadt. Tabulated resolution for well-founded semantics. In ILPS, 1993.
5. W. Chen, T. Swift, and D. S. Warren. Efficient implementation of general logical queries. JLP, 1995.
6. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1):20-74, 1996.
7. C. L. Conway, K. S. Namjoshi, D. Dams, and S. A. Edwards. Incremental algorithms for inter-procedural analysis of safety properties. In CAV, volume 3576 of LNCS, pages 449-461, Edinburgh, Scotland, July 2005.
8. S. Dawson, C. R. Ramakrishnan, and D. S. Warren. Practical program analysis using general purpose logic programming systems -a case study. In ACM PLDI, pages 117-126, 1996.
9. A. Demers, T. Reps, and T. Teitelbaum. Incremental evaluation for attribute grammars with application to syntax-directed editors. In POPL, pages 105-116. ACM Press, 1981.
10. P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In STOC, pages 365-372, New York, NY, USA, 1987. ACM Press.
11. A. Gupta and I. Mumick. Maintenance of materialized views: Problems, techniques, and applications. IEEE Data Engineering Bulletin, 18(2):3-18, 1995.
12. A. Gupta, I. S. Mumick, and V. S. Subrahmanian. Maintaining views incrementally. In SICMOD, pages 157-166, 1993.
13. M. Hermenegildo, G. Puebla, K. Marriott, and P. J. Stuckey. Incremental analysis of constraint logic programs. ACM Trans. Program. Lang. Syst., 22(2):187-223, 2000.
14. L. G. Jones. Efficient evaluation of circular attribute grammars. ACM Trans. Program. Lang. Syst., 12(3):429-462, 1990.
15. E. Mayol and E. Teniente. A survey of current methods for integrity constraint maintenance and view updating. In ER Workshops, pages 62-73, 1999.
16. R. Paige and S. Koenig. Finite differencing of computable expressions. TOPLAS, 4(3):402-454, 1982.
17. D. J. Pearce and P. H. J. Kelly. Online algorithms for topological order and strongly connected components. Technical report, Imperial College, London, 2003.
18. L. L. Pollock and M. L. Soffa. An incremental version of iterative data flow analysis. IEEE Trans. Softw. Eng., 15(12):1537-1549, 1989.
19. G. Puebla and M. V. Hermenegildo. Optimized algorithms for incremental analysis of logic programs. In SAS, pages 270-284, 1996.
20. C. R. Ramakrishnan et al. XMC: A logic-programming-based verification toolset. In CAV, number 1855 in LNCS, pages 576-580, 2000.
21. T. Reps. Optimal-time incremental semantic analysis for syntax-directed editors. In POPL, pages 169-176, New York, NY, USA, 1982. ACM Press.
22. D. Saha and C. R. Ramakrishnan. Incremental evaluation of tabled logic programs. In ICLP, volume 2916 of LNCS, pages 389-406, 2003.
23. D. Saha and C. R. Ramakrishnan. Incremental and demand-driven points-to analysis using logic programming. In PPDP. ACM Press, 2005.
24. D. Saha and C. R. Ramakrishnan. Symbolic support graph: A space-efficient data structure for incremental tabled evaluation. In ICLP, volume 3668 of LNCS, pages 235-249, 2005.
25. D. Saha and C. R. Ramakrishnan. Incremental evaluation of tabled prolog: Beyond pure logic programs. In PADL, volume 3819 of LNCS, pages 215-229. Springer, 2006.
26. D. Saha and C. R. Ramakrishnan. A local algorithm for incremental evaluation of logic programs. Technical report, Stony Brook University, 2006. Available at http://www. lmc.cs.sunysb.edu/~dsaha/local.
27. R. Seljee and H. de Swart. Three types of redundancy in integrity checking; an optimal solution. Journal of Data and Knowledge Enigineering, 30:135-151, 1999.
28. O. V. Sokolsky and S. A. Smolka. Incremental model checking in the modal mu-calculus. In CAV, volume 818 of LNCS, pages 351-363, 1994.
29. H. Tamaki and T. Sato. OLDT resolution with tabulation. In ICLP, pages 84-98, 1986.
30. J. A. Walz and G. F. Johnson. Incremental evaluation for a general class of circular attribute grammars. In PLDI, pages 209-221, New York, NY, USA, 1988. ACM Press.
31. XSB. The XSB logic programming system. Available at http: //xsb. sourcef orge, net.
32. G. Yang and M. Kifer. FLORA: Implementing an efficient DOOD system using a tabling logic engine. In CL 2000, volume 1861 of LNCS, pages 1078-1093, 2000.
33. J. Yur, B. G. Ryder, and W. Landi. An incremental flow- and context-sensitive pointer aliasing analysis. In ICSE, pages 442-451, 1999.
34. J. Yur, B. G. Ryder, W. Landi, and P. Stocks. Incremental analysis of side effects for C software system. In ICSE, pages 422-432, 1997.