- 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 Scholar
- 2 Beeri, C. and Ramakrishnan, R. On the Dower of magic. In Proceedings of the Sixth PODS Symposium, pp. Google ScholarDigital Library
- 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 ScholarDigital Library
- 4 Bruynooghe, M. A practical framework for the abstract interpretation 10, 2, 1991, 91-124. Google ScholarDigital Library
- 5 Bry, F. Query evaluation in recursive databases: Nottom-up and topdown reconciled. To be published in Data and KnowL Eng., 1990. Google ScholarDigital Library
- 6 Debray, S.K. and Warren, D.S. Automatic mode inference for logic programs. J. Logic Program. 5, 3, 1988, 207-230. Google ScholarDigital Library
- 7 Dietrich, S.W. and Warren, D.S. Extension tables' Memo relations in Department of Computer Science, SUNY at Stony Brook, Mar., 1986.Google Scholar
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 11 Kanamori, T. and Kawamura, T. Abstract interpretation Based on OhDT-Resolution. ICOT Tech. Rep., 1990.Google Scholar
- 12 Komorowski, J. A specification of an Abstract Prolog Machine and its application to partial evaluation. 1981.Google Scholar
- 13 Kowalski, R. Logic for Problem Soiv- 1979.Google Scholar
- 14 Kursawe, P. How to invent a Protog (1987).Google Scholar
- 15 Lloyd, J.w. Foundations of Logic Programming. Springer-Verlaf, N.Y., 1984. Google ScholarDigital Library
- 16 Lloyd, J.W. and Shepherdson, J.C. Partial evaluation in logic programming. J. Logic Program. 11, 3-4, 199i, pp. 2i7-244. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 19 Mellish, C. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, Eds. Abstract In- Ellis Horwood, (1987) pp. 181-198.Google Scholar
- 20 Michie, D. Memo functions and machine learning. Nature 2i8, (t968) pp. 19-22.Google Scholar
- 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 Scholar
- 22 Naqvi, S. and Tsur, S. A Logical Language for Data and Knowledge Base& Computer Science Press, N.Y., 1989. Google ScholarDigital Library
- 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 ScholarDigital Library
- 24 Niisson, U. Towards a methodology for the design of abstract machines of logic programming languages. To be published in j. Logic Program.Google Scholar
- 25 Pereira, F.C.N. and Warren, D.H.D. Definite clause grammars for language analysis. Ariif inieil. 13, (1980) 23 t-278.Google Scholar
- 26 Pereira, F.C.N. and Warren, D.H.D. Parsing as deduction. In Proceedings of ACL Conference (1983). Google ScholarDigital Library
- 27 Ramakrishnan, R. Magic Temlogic programs. J. Logic Program. I I, 3-4 (1991) 189-216. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 31 Seki, H. On the power of Alexander templates. In Proceedings of the Eight PODS Symposium, Philadelphia, (1989), pp. 150-159. Google ScholarDigital Library
- 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 Scholar
- 33 Sterling, L. and Shapiro, E. The Art of Prolog. MiT Press, Cambridge, Mass., ISBN 0-262-19250-0, 1986, p. 427.Google Scholar
- 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 ScholarDigital Library
- 35 Ullman, J.D. Principles of Database and Knowledge-Base Systems, Vol I. Computer Science Press, N.Y., 1988. Google ScholarDigital Library
- 36 Ullman, J.D. Bottom-up beats topdown for Datalog. In Proceedings of the Eighth PODS Symposium, Philadelphia, 1989, pp. 140-149. Google ScholarDigital Library
- 37 vanEmden, M.H. and Kowalski, R. The semantics of predicate logic as a programming language. J. ACM 23, 4, 1976, 722-742. Google ScholarDigital Library
- 38 Vieille, J. Recursive query processing: The power of logic. Theoretical Comput. Sci. 69, I (1989) pp. 1-53. Google ScholarDigital Library
- 39 Warren, D.S. Syntax and semantics in parsing: An application to Mongague grammar. Ph.D. thesis, Univ. of Michigan, 1979. Google ScholarDigital Library
- 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 Scholar
- 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 Scholar
Index Terms
- Memoing for logic programs
Recommendations
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L ∈ {KD5,KD45,S5}, or L ∈ {KD,T,KDB,B} and the modal depth of P is ...
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs
We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, ...
Comments