An extension of Van Gelder's alternating fixpoint to magic programs

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 506-521

  Morishita, Shinichi ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; COMPUTER SOFTWARE; PROGRAMMING THEORY; QUERY LANGUAGES;

DEDUCTIVE DATABASE; INFORMATION PASSING STRATEGIES; MAGIC PROGRAMS; MAGIC SETS TRANSFORMATION; SEMANTICS; VAN GELDER ALTERNATING FIXPOINT TECHNIQUE; WELL FOUNDED MODELS;

DATABASE SYSTEMS;

EID: 0030164804     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0038     Document Type: Article

References (31)

1. K. R. Apt, H. A. Blair, and A. Walker, Towards a theory of declarative knowledge, in "Foundations of Deductive Databases and Logic Programming" (J. Minker, Ed.), pp. 89-148, Morgan Kaufmann, Los Altos, CA, 1988.
2. I. Balbin, K. Meenakshi, and K. Ramamohanarao, A query independent method for magic set computation on stratified databases, in "Proc. International Conference on Fifth Generation Computer Systems, 1988," pp. 711-718.
3. I. Balbin, I. Port, K. Ramamohanarao, and K. Meenakshi, Efficient bottom-up computation of queries on stratified databases, J. Logic Programming 11 (1991), 295-345.
4. F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query-processing strategies, in "Proc. of ACM SIGMOD International Conference on Management of Data, 1986," pp. 16-51.
5. F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, Magic sets and other strange ways to implement logic programs, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1986," pp. 1-15.
6. C. Beeri and R. Ramakrishnan, On the power of magic, J. Logic Programming 10 (1991), 255-299.
7. W. Chen and D. S. Warren, A goal-oriented approach to computing the well founded semantics, in "Proc. Joint International Conference and Symposium on Logic Programming, 1992."
8. W. Chen and D. S. Warren, Query evaluation under the well founded semantics, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993," pp. 168-179.
9. K. L. Clark, Negation as failure, in "Logic and Databases" (H. Gallaire and J. Minker, Ed.), pp. 293-322, Plenum, New York, 1978.
10. M. A. Derr, S. Morishita, and G. Phipps, Design and implementation of the Glue-Nail database system, in "Proc. of ACM SIGMOD International Conference on Management of Data, 1993," pp. 147-156.
11. M. A. Derr, S. Morishita, and G. Phipps, The glue-nail deductive database system: Design, implementation, and evaluation, VLDB J. 3, No. 2 (1994), 123-160.
12. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in "Proc. of International Conference Symposium on Logic Programming, 1988," pp. 1070-1080.
13. J. M. Kerisit and J. M. Pugin, Efficient query answering on stratified databases, in "Proc. of International Conference on Fifth Generation Computer Systems, 1988," pp. 719-726.
14. D. B. Kemp, P. J. Stuckey, and D. Srivastava, Magic sets and bottom-up evaluation of well-founded models, in "Proc. of International Logic Programming Symposium, 1991," pp. 337-351.
15. D. B. Kemp, P. J. Stuckey, and D. Srivastava, Query restricted bottom-up evaluation of normal logic programs, in "Proc. Joint International Conference and Symposium on Logic Programming, 1992," pp. 288-302.
16. J. W. Lloyd, "Foundations of Logic Programming," Springer-Verlag, New York, 1987.
17. S. Morishita, An alternating fixpoint tailored to magic programs, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993," pp. 123-134.
18. C. H. Papadimitriou and M. Yannakakis, Tie-breaking semantics and structural totality, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992," pp. 16-22.
19. T. C. Przymusinski, Every logic program has a natural stratification and iterated least fixed point model, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989," pp. 11-21.
20. R. Ramakrishnan, D. Srivastava, and S. Sudarshan, Controlling the search in bottom-up evaluation, in "Proc. of Joint International Conference and Symposium on Logic Programming, 1992," pp. 273-287.
21. J. Rohmer, R. Lescoeur, and J. M. Kerisit, The Alexander method, a technique for the processing of recursive axioms in deductive database queries, New Generation Computing 4 (1986), 522-528.
22. K. A. Ross, A procedural semantics for well-founded negation in logic programs, J. Logic Programming 10, No. 1 (1992), 1-22.
23. K. A. Ross, Modular stratification and magic sets for Datalog programs with negation, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990," pp. 161-171.
24. K. A. Ross, Modular acyclicity and tail recursion in logic programs, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991," pp. 92-101.
25. Y. Sagiv, Is there anything better than magic?, in "Proc. of International Logic Programming Symposium, 1990," pp. 235-254.
26. H. Seki, On the power of Alexander templates, in "Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989," pp. 150-159.
27. K. Sagonas, T. Swift, and D. S. Warren, XSB as an efficient deductive database engine, in "Proc. ACM SIGMOD International Conference on Management of Data, 1994," pp. 442-453.
28. H. Tamaki and T. Sato, OLD resolution with tabulation, in "Proc. of International Conference on Logic Programming, 1986," pp. 84-98.
29. J. D. Ullman, "Principles of Database and Knowledge-Base Systems," Vol. 2, Computer Science Press, New York, 1989.
30. A. Van Gelder, K. A. Ross, and J. S. Schlipf, The well-founded semantics for general logic programs, J. Assoc. Comput. Mach. 38, No. 3 (1991), 620-650.
31. A. Van Gelder, The alternating fixpoint of logic programs with negation, J. Comput. System Sci. 47 (1933), 185-221.