Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models

Journal of Logic Programming

Volumn 32, Issue 3, 1997, Pages 171-205

  Stuckey, Peter J ^a   Sudarshan, S ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE; RECURSIVE FUNCTIONS;

ORDERED SEARCH; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 0031237314     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00110-0     Document Type: Article

References (27)

1. Apt, K. R., Blair, H. A., and Walker, A., Towards a Theory of Declarative Knowledge, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 89-148.
2. Balbin, I. and Ramamohanarao, K., A Generalization of the Differential Approach to Recursive Query Evaluation, Journal of Logic Programming 4(3) (1987).
3. Bancilhon, F., Naive Evaluation of Recursively Defined Relations, in: Brodie and Mylopoulos (eds.), On Knowledge Base Management Systems - Integrating Database and AI Systems, Springer-Verlag, Berlin/New York, 1985.
4. Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. D., Magic Sets and Other Strange Ways to Implement Logic Programs, in: Proceedings of the ACM Symposium on Principles of Database Systems, Cambridge, MA, Mar. 1986, pp. 1-15.
5. Baral, C. and Subrahmanian, V. S., Dualities between Alternate Semantics for Logic Programming and Nonmonotonic Reasoning, in: Proceedings of the 1st International Workshop on Logic Programming and Non-Monotonic Reasoning, MIT Press, Cambridge, MA, 1991, pp. 69-86.
6. Beeri, C. and Ramakrishnan, R., On the Power of Magic, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1987, pp. 269-283.
7. Bidoit, N. and Legay, P., WELL! An Evaluation Procedure for All Logic Programs, in: Proceedings of the International Conference on Database Theory, Dec. 1990, pp. 335-348.
8. Chen, W., Swift, T., and Warren, D. S., Efficient Top-Down Computation of Queries under the Well-Founded Semantics, Technical Report 93-CSE-33, Southern Methodist University, Aug. 1993.
9. Chen, W. and Warren, D. S., A Goal-Oriented Approach to Computing the Well Founded Semantics, in: Proceedings of the Joint International Conference and Symposium on Logic Programming, 1992, pp. 589-606.
10. Chen, W. and Warren, D. S., Query Evaluation under the Well-Founded Semantics, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1993.
11. Kemp, D., Srivastava, D., and Stuckey, P., Magic Sets and Bottom-Up Evaluation of Well-Founded Models, in: Proceedings of the International Logic Programming Symposium, 1991, pp. 337-351.
12. Kemp, D., Srivastava, D., and Stuckey, P., Query Restricted Bottom-Up Evaluation of Normal Logic Programs, in: Proceedings of the Joint International Conference and Symposium on Logic Programming, 1992, pp. 288-302.
13. Leone, N. and Rullo, P., Safe Computation of the Well-Founded Semantics of DATALOG Queries, Information Systems 17(1):17-31 (1992).
14. Lloyd, J. W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, Berlin/New York, 1987.
15. Morishita, S., An Alternating Fixpoint Tailored to Magic Programs, in: Proceedings of the 1993 ACM Symposium on Principles of Database Systems, 1993.
16. Przymusinski, T. C., On the Declarative Semantics of Stratified Deductive Databases, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193-216.
17. Ramakrishnan, R., Magic Templates: A Spellbinding Approach to Logic Programs, in: Proceedings of the International Conference on Logic Programming, 1988, pp. 140-159.
18. Ramakrishnan, R., Srivastava, D., and Sudarshan, S., Controlling the Search in Bottom-Up Evaluation, in: Joint International Conference and Symposium on Logic Programming, 1992, pp. 273-287.
19. Ramakrishnan, R., Srivastava, D., and Sudarshan, S., Controlling the Search in Bottom-Up Evaluation. Full version of [18] submitted, 1993.
20. Ross, K. A., A Procedural Semantics for Well-Founded Negation in Logic Programs, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1989.
21. Ross, K. A., Modular Stratification and Magic Sets for DATALOG Programs with Negation, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1990, pp. 161-171.
22. Ross, K. A., The Semantics of Deductive Databases, Ph.D. Thesis, Department of Computer Science, Stanford University, Aug. 1991.
23. Swift, T., Efficient Evaluation of General Logic Programs, Ph.D. Thesis, State University of New York at Stony Brook, Dec. 1994.
24. Tamaki, H. and Sato, T., OLD Resolution with Tabulation, in: Proceedings of the Third International Conference on Logic Programming (LNCS 225), Springer-Verlag, Berlin, 1986, pp. 84-98.
25. Van Gelder, A., The Alternating Fixpoint of Logic Programs with Negation, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1989, pp. 1-10.
26. Van Gelder, A., Ross, K., and Schlipf, J. S., Unfounded Sets and Well-Founded Semantics for General Logic Programs, Journal of the ACM 38(3):620-650 (1991).
27. Vieille, L., Recursive Query Processing: The Power of Logic, Theoretical Computer Science 1-53 (1989).