Principles and Practice of Unification Factoring

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 5, 1996, Pages 528-563

  Dawson, Steven ^a,b   Ramakrishnan, C R ^a,c   Skiena, Steven ^a,c   Swift, Terrance ^a,c  

^a STONY BROOK UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

^c Stony Brook University   (United States)

Author keywords

D.3.4 Programming Languages : Processors compilers; optimization; F.1.1 Computation by Abstract Devices : Models of Computation automata

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; INDEXING (OF INFORMATION); MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

NONNUMERICAL ALGORITHMS; PATTERN MATCHING; PROBLEM COMPLEXITY; TRIE MINIMIZATION; UNIFICATION FACTORING;

PROLOG (PROGRAMMING LANGUAGE);

EID: 0030246077     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/232706.232722     Document Type: Article

References (21)

1. BACHMAIR, L., CHEN, T., AND RAMAKRISHNAN, I. V. 1993. Associative-commutative discrimination nets. In Theory and Practice of Software Development. Lecture Notes in Computer Science, vol. 668. Springer-Verlag, Berlin, 61-74.
2. CHEN, T., RAMAKRISHNAN, I. V., AND RAMESH, R. 1992. Multistage indexing algorithms for speeding Prolog execution. In Joint International Conference and Symposium on Logic Programming. MIT Press, Cambridge, Mass., 639-653.
3. CHEN, W. AND WARREN, D. S. 1993. Towards effective evaluation of general logic programs. Tech. Rep., SUNY, Stony Brook, N.Y. A shortened version of this paper appeared in the Proceedings of the 12th PODS.
4. CHEN, W., KIFER, M., AND WARREN, D. S. 1993. HiLog: A foundation for higher-order logic programming. J. Logic Program. 15, 3, 187-230.
5. COMER, D. AND SETHI, R. 1977. The complexity of trie index construction. J. ACM 24, 3 (July), 428-440.
6. DAWSON, S., RAMAKRISHNAN, C. R., RAMAKRISHNAN, I. V., SAGONAS, K., SKIENA, S., SWIFT, T., AND WARREN, D. S. 1995. Unification factoring for efficient execution of logic programs. In ACM Symposium on Principles of Programming Languages. ACM, New York, 247-258.
7. HANS, W. 1992. A complete indexing scheme for WAM-based abstract machines. In International Symposium on Programming Language Implementation and Logic Programming. Lecture Notes in Computer Science, vol. 631. Springer-Verlag, Berlin, 232-244.
8. HICKEY, T. AND MUDAMBI, S. 1989. Global compilation of Prolog. J. Logic Program. 7, 193-230.
9. KLIGER, S. AND SHAPIRO, E. 1991. From decision trees to decision graphs. In North American Conference on Logic Programming. MIT Press, Cambridge, Mass., 97-116.
10. LASSEZ, J.-L., MAHER, M., AND MARIOTT, K. 1988. Unification revisited. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, San Mateo, Calif., 587-625.
11. LLOYD, J. W. 1984. Foundations of Logic Programming. Springer-Verlag, Berlin.
12. MCCUNE, W. 1992. Experiments with discrimination-tree indexing and path indexing for term retrieval. J. Automated Reasoning 9, 147-167.
13. PALMER, D. AND NAISH, L. 1991. NUA-Prolog: An extension to the WAM for parallel Andorra. In International Conference on Logic Programming. MIT Press, Cambridge, Mass., 429-442.
14. RAMESH, R., RAMAKRISHNAN, I. V., AND WARREN, D. S. 1990. Automata-driven indexing of Prolog clauses. In ACM Symposium on Principles of Programming Languages. ACM, New York, 281-290.
15. RIVEST, R. L. AND HYAFIL, L. 1976. Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5, 1 (May), 15-17.
16. SEKAR, R. C., RAMAKRISHNAN, I. V., AND RAMESH, R. 1992. Adaptive pattern matching. In International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 247-260. To appear in SIAM J. Comput.
17. SEKAR, R. C., RAMAKRISHNAN, I. V., AND RAMESH, R. 1992. Adaptive pattern matching. In International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 247-260. To appear in SIAM J. Comput.
18. TICK, E. AND KORSLOOT, M. 1994. Determinacy testing for nondeterminate logic programming languages. ACM Trans. Program. Lang. Syst. 16, 1 (Jan.), 3-34.
19. VAN ROY, P. 1991. Can logic programming execute as fast as imperative programming? Ph.D. thesis, Univ. of California, Berkeley, Calif.
20. WARREN, D. H. D. AND PEREIRA, F. C. N. 1982. An efficient easily adaptable system for interpreting natural language queries. Am. J. Comput. Ling. 8, 3-4, 110-122.
21. ZHOU, N. 1993. Global optimizations in a Prolog compiler for the TOAM. J. Logic Program. 15, 275-294.