Linear tabulated resolution based on Prolog control strategy

Theory and Practice of Logic Programming

Volumn 1, Issue 1, 2001, Pages 71-103

  Shen, Yi Dong ^a,b   Yuan, Li Yan ^b   You, Jia Huai ^b   Zhou, Neng Fa ^c  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITY OF ALBERTA   (Canada)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Logic programming; Loop checking; Prolog; Resolution; Tabling

Indexed keywords

EID: 0003287254     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068400001010     Document Type: Article

References (23)

1. Apt, K. R., Blair, H. A. and Walker, A. (1988) Towards a theory of declarative knowledge. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann, Los Altos, CA.
2. Bol, R. N., Apt, K. R. and Klop, J. W. (1991) An analysis of loop checking mechanisms for logic programs. Theor. Comput. Sci. 86(1), 35-79.
3. Bol, R. N. and Degerstedt, L. (1993) The underlying search for magic templates and tabulation. In: D. S. Warren (ed.), Proceedings of the Tenth International Conference on Logic Programming, pp. 793-811. MIT Press, Cambridge, MA.
4. Bol, R. N. and Degerstedt, L. (1998) Tabulated resolution for the well-founded semantics. J. Logic Programming, 34(2), 67-109.
5. Chen, W. D., Swift, T. and Warren, D. S. (1995) Efficient top-down computation of queries under the well-founded semantics. J. Logic Programming, 24(3), 161-199.
6. Chen, W. D. and Warren, D. S. (1996) Tabled evaluation with delaying for general logic programs. J. ACM, 43(1), 20-74.
7. Covington, M. A. (1985) Eliminating unwanted loops in Prolog. SIGPLAN Notices, 20(1), 20-26.
8. Ferrucci, F., Pacini, G. and Sessa, M. (1995) Redundancy elimination and loop checks for logic programs. Infor. & Computation, 119(2), 137-153.
9. Kowalski, R. A. and Kuehner, D. (1971) Linear resolution with selection functions. Artif. Intell. 2, 227-260.
10. Lloyd, J. W. (1987) Foundations of Logic Programming, 2nd edition. Springer-Verlag, Berlin.
11. Sagonas, K., Swift, T. and Warren, D. S. (1994) XSB as an efficient deductive database engine. In: R. T. Snodgrass and M. Winslett (eds.), Proceedings of the 1994 ACM SIGMOD Int. Conf. on Management of Data, pp. 442-453. ACM Press, New York.
12. Sagonas, K. and Swift, T. (1998) An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Trans. Programming Lang. and Syst. 20(3), 586-634.
13. Sagonas, K., Swift, T., Warren, D. S., Freire, J. and Rao, P. (1998) The XSB Programmer's Manual (Version 1.8). Department of Computer Science, SUNY at Stony Brook. Available from http://www.cs.sunysb.edu/sbprolog/xsb-page.html.
14. Shen, Y. D. (1997) An extended variant of atoms loop check for positive logic programs. New Generation Comput. 15(2), 187-204.
15. Shen, Y. D., Yuan, L. Y., You, J. H. and Zhou, N. F. (1999) Linear tabulated resolution for the well founded semantics. In: M. Gelfond, N. Leone and G. Pfeifer (eds.), Proceedings of the 5th Int. Conf. on Logic Programming and Nonmonotonic Reasoning, pp. 192-205. Springer-Verlag, Berlin.
16. Skordev, D. (1997) An abstract approach to some loop detection problems. Fundamenta Informaticae, 31, 195-212.
17. Tamaki, H. and Sato, T. (1986) OLD resolution with tabulation. In: E. Shapiro (ed.), Proceedings of the Third Int. Conf. on Logic Programming, pp. 84-98. Springer-Verlag, Berlin.
18. Van Gelder, A. (1987) Efficient loop detection in Prolog. J. Logic Programming, 4(1), 23-31.
19. Van Gelder, A. (1989) Negation as failure using tight derivations for general logic programs. J. Logic Programming, 6(1&2), 109-133.
20. Vieille, L. (1989) Recursive query processing: the power of logic. Theoret. Comput. Sci. 69, 1-53.
21. Warren, D. H. D. (1983) An abstract Prolog instruction set. Technical Report 309, SRI International.
22. Warren, D. S. (1992) Memoing for logic programs. Comm. ACM, 35(3), 93-111.
23. Zhou, N. F. (1996) Parameter passing and control stack management in Prolog implementation revisited. ACM Trans. Programming Lang. Syst. 18(6), 752-779.