Efficient tests for top-down termination of logical rules

Journal of the ACM (JACM)

Volumn 35, Issue 2, 1988, Pages 345-373

  Ullman, Jeffrey D ^a   Van Gelder, Allen ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY; COMPUTER PROGRAMMING - ALGORITHMS;

ANALYSIS OF ALGORITHMS; COMPLEXITY OF ALGORITHMS; LOGIC PROGRAMS;

COMPUTER SOFTWARE;

EID: 0023994541     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/42282.42285     Document Type: Article

References (20)

1. AHO, A. V., HoPcaorrr, J. E., and ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.]
2. ASPVALL, B., and SHILOACH, Y. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. STAN-CS-79-703, Dept. of Computer Science, Stanford Univ., Stanford, Calif., 1979.]
3. BANCILHON, F., AND RAMAKRISHNAN, R. An amateur's introduction to recursive query processing strategies, in Proceedings of the ACM SIGMOD International Conference on Management of Data (Washington, D.C., May 28-30). ACM, New York, 1986, pp 16-52.]
4. Boyer, R.S., AND MANNA, Z. Proving termination with multidset orderings. Communs. ACM 22,8 (1979), 465-476.]
5. DERSHOWITZ, N., AND MANNA, Z. Proving termination with multiset orderings. Commun. ACM 22, 8 (1979), 465-476.]
6. ER1ctc~nN, R. D. Optimality of ~tatinnary halting policies and finite termination of successive approximations. Tech. Rep. TR33. Dept. of Operations Research, Stanford Univ., Stanford, Calif., 1978.]
7. FISCHER, i. J., and RABIN, i.O. Super-exponential complexity of Presberger arithmetic. In Complexity of Computation, R. M. Karp, Ed. American Mathematical Society, Providence, R.I., 1974.]
8. MORRIS, K., ULLMAN, J. D., AND VAN GELDER, A. Design overview of the NAIL! system. In Proceedings of the 3rd International Conference on Logic Programming (London, England, July). Springer-Verlag, New York, 1986, pp. 554-568.]
9. NAISH, L. Automatic generation of control for logic programs. Tech. Rep. TR83/6. Dept. of Computer Science, Univ. of Melbourne, Melbourne, Australia, i 983.]
10. PAPADIMITRIOU, C. H., and STEIGLITZ, K. Combinatorial Optimization. Prentice-Hall, Englewood Cliffs, N.J., 1982.]
11. PRATT, V. Two easy theries whose combination is hard. Unpubliushid memorandum, M.I.T., Cambridge, Mass., 1977.]
12. ROSENKRANTZ, O. J., AND HUNT, H. B., III Processing conjunctive predicates and queries. In Proceedings of the 6th International Conference on Very Large Data Bases. F. Lochovsky and R. Taylor, Eds. IEEE, New York, 1980, pp. 64-72.]
13. SAGIV, Y., AND ULLMAN, J.O. Complexity of a top-down capture rule. STAN-CS-84-1009. Dept. of Computer Science, Stanford Univ., Stanford, Calif., 1984.]
14. SHAPIRO, E.Y. A subset of concurrent prolog and its interpreter. Tech. Rep. TR-003. ICOT, Tokyo 108, Japan, 1983.]
15. TARJAN, R.E. Depth first search and linear graph algorithms. SIAM J. Comput. 1, 2 (1972), 146-160.]
16. TSUR, S., and ZANIOLO, C. LDL: A logic-based data-language, in Proceedings of the 12th International Conference on Very Large Data Bases (Kyoto, Japan).DL: A logic-based data-language, in Proceedings of the 12th International Conference on Very Large Data Bases (Kyoto, Japan). IEEE, New York, 1986, pp. 33-4 i.]
17. ULLMAN, J.D. Implementation of logical query languages for databases. ACM Trans. Database Syst. 10, 3 (Sept. 1985), 289-321.]
18. ULLAMAN, J.D. Implementatioan of logical query language. In Proceedings of the 12th 85-1046, Dept. of Computer Science, Stanford Univ., Stanford, Calif., 1985.]
19. VAN EMDEN, M. H., AND KOWALSKI, R. The semantics of predicate logic as a programming language. J. ACM 23, 4 (Oct. 1976), 733-742.]
20. VAN GELDER, A. Deriving relations among argument sizes in logic programs. Unpublished memorandum. Dept. of Computer Science, Stanford Univ., Stanford, Calif., 1986.]