Efficient access mechanisms for tabled logic programs

Journal of Logic Programming

Volumn 38, Issue 1, 1999, Pages 31-54

  Ramakrishnan, I V ^a   Rao, Prasad ^b   Sagonas, Konstantinos ^c   Swift, Terrance ^d   Warren, David S ^a  

^a Stony Brook University   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c UNIVERSITY OF LEUVEN   (Belgium)

^d UNIVERSITY OF MARYLAND   (United States)

Author keywords

Discrimination nets; Implementation; Indexing; SLG WAM; Tabling; Tries

Indexed keywords

CODES (SYMBOLS); DATA ACQUISITION; INDEXING (OF INFORMATION); PROGRAM COMPILERS; PROLOG (PROGRAMMING LANGUAGE); TABLE LOOKUP;

SUBSTITUTION FACTORING;

LOGIC PROGRAMMING;

EID: 0032755587     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10013-4     Document Type: Article

References (20)

1. L. Bachmair, T. Chen, I.V. Ramakrishnan, Associative-commutative discrimination nets, in: M.C. Gaudel, J.P. Jouannaud (Eds.), Proceedings of TAPSOFT'93: Fourth International Joint Conference on Theory and Practice of Software Development, Orsay, France, Lecture Notes in Computer Science, vol. 668, Springer, Berlin. 1993, pp. 61-74.
2. T. Chen, I.V. Ramakrishnan, R. Ramesh, Multistage indexing algorithms for speeding prolog execution, Software Practice and Experience 24 (12) (1994) 1097-1119.
3. W. Chen, D.S. Warren, Tabled evaluation with delaying for general logic programs, J. Assoc. Comput. Mach. 43 (1) (1996) 20-74.
4. D. Comer, R. Sethi, The complexity of trie index construction, J. Assoc. Comput. Mach. 24 (3) (1977) 428-440.
5. S. Dawson, C.R. Ramakrishnan, I.V. Ramakrishnan, K. Sagonas, S. Skiena, T Swift, D.S. Warren, Unification factoring for the efficient execution of logic programs, in: Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Fransisco, CA, ACM (Assoc. Comput. Machinery), New York, 1995, pp. 247-258.
6. P. Graf, Term Indexing, in: Lecture Notes in Artificial Intelligence, vol. 1053, Springer, Berlin, 1996.
7. D.E. Knuth, The Art of Computer Programming: Vol. 1. Fundamental Algorithms, 2nd edition, Addison-Wesley, Reading, MA, 1973.
8. W.W. McCune, Experiments with discrimination-tree indexing and path indexing for term retrieval, J. Automat. Reason. 9 (2) (1992) 147-167.
9. J.F. Naughton, R. Ramakrishnan, Y. Sagiv, J.D. Ullman, Argument reduction by factoring, Theoret. Comput. Sci. 146 (1/2) (1995) 269-310.
10. H.J. Ohlbach, Abstraction tree indexing for terms, in: Proceedings of the Ninth European Conference on Artificial Intelligence, Stockholm, Sweden, Pitman, London, 1990, pp. 479-484.
11. Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, D.S. Warren, Efficient model checking using tabled resolution, in: O. Grumberg (Ed.), Proceedings of the Ninth international Conference on Computer-Aided Verification, Haifa, Israel, Lecture Notes in Computer Science, vol. 1254, Springer, Berlin, 1997, pp. 143-154.
12. R. Ramakrishnan, J.D. Ullman, A survey of deductive database systems, J. Logic Programming 23 (2) (1995) 125-149.
13. K. Sagonas, T. Swift, An abstract machine for tabled execution of fixed-order stratified logic programs, ACM Trans. Programming Languages Systems, to appear.
14. K. Sagonas, T. Swift, D.S. Warren, XSB as an efficient deductive database engine, in: Proceedings of the ACM SIGMOD International Conference on the Management of Data, Minneapolis, MN, ACM (Assoc. Comput. Machinery), New York, 1994, pp. 442-453.
15. R.C. Sekar, R. Ramesh, I.V. Ramakrishnan, Adaptive pattern matching, SIAM J. Comput. 24 (6) (1995) 1207-1234.
16. S. Sudarshan, R. Ramakrishnan, Optimizations of bottom-up evaluation with non-ground terms, in: D. Miller (Ed.), Proceedings of the 1993 International Symposium on Logic Programming, Vancouver, Canada, MIT Press, Cambridge, MA, 1993, pp. 557-574.
17. A. Van Gelder, Negation as failure using tight derivations for general logic programs, J. Logic Programming 6 (1/2) (1989) 109-134.
18. E. Villemonte de la Clergerie, Layer sharing: An improved structure-sharing framework, in: Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, 1993, pp. 345-359.
19. A. Voronkov, The anatomy of Vampire: Implementing bottom-up procedures with code trees, J. Automat. Reason. 15 (2) (1995) 237-265.
20. D.H.D. Warren, An abstract Prolog instruction set. Technical Report 309, SRI International, Menlo Park, USA, October 1983.