skip to main content
article
Free Access

Memoing for logic programs

Published:01 March 1992Publication History
First page image

References

  1. 1 Ranrilhnn F et al Ma~ic ~er,~ and other strange ways to implement logic programs, in Proceedings of the Fifth PODS Symposium, pp. !-!5, 1986.Google ScholarGoogle Scholar
  2. 2 Beeri, C. and Ramakrishnan, R. On the Dower of magic. In Proceedings of the Sixth PODS Symposium, pp. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Benkerimi, K. and Lloyd, J.W. A partial evaluation procedure tor logic programs. In Proceedings of the 1990 North American Conference on Logic Programming. MIT Press, pp. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Bruynooghe, M. A practical framework for the abstract interpretation 10, 2, 1991, 91-124. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Bry, F. Query evaluation in recursive databases: Nottom-up and topdown reconciled. To be published in Data and KnowL Eng., 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Debray, S.K. and Warren, D.S. Automatic mode inference for logic programs. J. Logic Program. 5, 3, 1988, 207-230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Dietrich, S.W. and Warren, D.S. Extension tables' Memo relations in Department of Computer Science, SUNY at Stony Brook, Mar., 1986.Google ScholarGoogle Scholar
  8. 8 Earley, J. An efficient context-free parsing algorithm. Commun. ACM~ terpretation for type checking. In Proceedings of the Third International 13, (1970) 94-102. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 File, G. and Sottero, P. Abstract interpretation for type checking. In Proceedings of the Third International Symposium on Programming Language Implementation and Logic Programming, Springer-Verias, N.Y., 199I, pp. 311-322,Google ScholarGoogle Scholar
  10. 10 Hickey, T.J. and Smith, D.A. Toward the partial evaluation of CLP languages. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press, June 1990, pp. 43-51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Kanamori, T. and Kawamura, T. Abstract interpretation Based on OhDT-Resolution. ICOT Tech. Rep., 1990.Google ScholarGoogle Scholar
  12. 12 Komorowski, J. A specification of an Abstract Prolog Machine and its application to partial evaluation. 1981.Google ScholarGoogle Scholar
  13. 13 Kowalski, R. Logic for Problem Soiv- 1979.Google ScholarGoogle Scholar
  14. 14 Kursawe, P. How to invent a Protog (1987).Google ScholarGoogle Scholar
  15. 15 Lloyd, J.w. Foundations of Logic Programming. Springer-Verlaf, N.Y., 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Lloyd, J.W. and Shepherdson, J.C. Partial evaluation in logic programming. J. Logic Program. 11, 3-4, 199i, pp. 2i7-244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 Maier, D. and Warren, D.S. Com tmting with Logic: Logic Programming with Prolog. Benjamin/Cummings. Menlo Park, Calif., ISBN 0-8053- 6681-4, 535 pp, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Marriott, K., sondergarrd, H., and Dart, P. A characterization of nonfloundering logic programs. In Proceedings of the 1990 North Amercian Conference on Logic Programming, MIT Press, 1990, pp. 661-680. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 Mellish, C. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, Eds. Abstract In- Ellis Horwood, (1987) pp. 181-198.Google ScholarGoogle Scholar
  20. 20 Michie, D. Memo functions and machine learning. Nature 2i8, (t968) pp. 19-22.Google ScholarGoogle Scholar
  21. 21 Muthukumar, K. and Hermenegone, M. Combined determination of sharing and freeness of program variables through abstract interpre- International Conference on Logic Programming, MIT Press, ( 1991) pp. 49-63.Google ScholarGoogle Scholar
  22. 22 Naqvi, S. and Tsur, S. A Logical Language for Data and Knowledge Base& Computer Science Press, N.Y., 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 Nilsson, U. Abstract interpretation: A kind of magic. In Proceedings of the Third International Symposium on Programrning Language Implementation and Logic Programming, Springer- Verlag, N.Y., 1991, pp. 299-310. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 Niisson, U. Towards a methodology for the design of abstract machines of logic programming languages. To be published in j. Logic Program.Google ScholarGoogle Scholar
  25. 25 Pereira, F.C.N. and Warren, D.H.D. Definite clause grammars for language analysis. Ariif inieil. 13, (1980) 23 t-278.Google ScholarGoogle Scholar
  26. 26 Pereira, F.C.N. and Warren, D.H.D. Parsing as deduction. In Proceedings of ACL Conference (1983). Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 Ramakrishnan, R. Magic Temlogic programs. J. Logic Program. I I, 3-4 (1991) 189-216. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28 Kerisit, J.-M. The Alexander method--A technique for the processing of recursive axioms for the productive databases. New Gun. Coraput 4, 3 (1986) 273-285. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. 29 Sagiv, Y. Is there anything Better than magic? In Proceedings of the i990 North American Conference on Logic Programming, MIT Press, 1990, pp. 235-254. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. 30 Sahiin, u. 1 lae Mixtus approach to automatic partial evaluation of full Prolog. In Proceedings of the 1990 North American Conference on Logic Programming, MIT Press, 1990, pp. 377-390. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. 31 Seki, H. On the power of Alexander templates. In Proceedings of the Eight PODS Symposium, Philadelphia, (1989), pp. 150-159. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 32 Seki, H. and 1toh, H. A query evaluation method for stratified pro- Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, 1988, 195-211.Google ScholarGoogle Scholar
  33. 33 Sterling, L. and Shapiro, E. The Art of Prolog. MiT Press, Cambridge, Mass., ISBN 0-262-19250-0, 1986, p. 427.Google ScholarGoogle Scholar
  34. 34 Tamaki, H. and Sato, T. OLD Resolution with Tabulation. In Proceedings of the Third International Conference on Logic Programming (London), Lecture Notes in Computer Science 225, Springer-Verlag, 1986, pp. 84-98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. 35 Ullman, J.D. Principles of Database and Knowledge-Base Systems, Vol I. Computer Science Press, N.Y., 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. 36 Ullman, J.D. Bottom-up beats topdown for Datalog. In Proceedings of the Eighth PODS Symposium, Philadelphia, 1989, pp. 140-149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. 37 vanEmden, M.H. and Kowalski, R. The semantics of predicate logic as a programming language. J. ACM 23, 4, 1976, 722-742. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. 38 Vieille, J. Recursive query processing: The power of logic. Theoretical Comput. Sci. 69, I (1989) pp. 1-53. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. 39 Warren, D.S. Syntax and semantics in parsing: An application to Mongague grammar. Ph.D. thesis, Univ. of Michigan, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. 40 Warren, D.S. The XWAM: A machine that integrates Protog and Deductive, database query evaluation. Tech. Rep. 89/25, Department of Computer Science, SUNY at Stony Brook, Oct. 1989.Google ScholarGoogle Scholar
  41. 41 Warren, D.S. Computing the wellfounded semantics of logic programs. Tech. Rep. 91/12, Department of Computer Science, SUNY at Stony Brook, June, 1991.Google ScholarGoogle Scholar

Index Terms

  1. Memoing for logic programs

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Communications of the ACM
            Communications of the ACM  Volume 35, Issue 3
            March 1992
            110 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/131295
            Issue’s Table of Contents

            Copyright © 1992 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 March 1992

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Author Tags

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader