Memoing for logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Memoing for logic programs

Full text

Pdf (4.05 MB)

Source

Communications of the ACM archive
Volume 35 , Issue 3 (March 1992) table of contents

Pages: 93 - 111

Year of Publication: 1992

ISSN:0001-0782

Author

David S. Warren

Department of Computer Science, SUNY atStony Brook, Stony Brook, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 35, Citation Count: 34

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/131295.131299 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	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.
	2	C. Beeri , R. Ramakrishnan, On the power of magic, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.269-284, March 23-25, 1987, San Diego, California, United States [doi>10.1145/28659.28689]
	3	Kerima Benkerimi , John W. Lloyd, A partial evaluation procedure for logic programs, Proceedings of the 1990 North American conference on Logic programming, p.343-358, January 1990, Austin, Texas, United States
	4	Maurice Bruynooghe, A practical framework for the abstract interpretation of logic programs, Journal of Logic Programming, v.10 n.2, p.91-124, Feb. 1991 [doi>10.1016/0743-1066(91)80001-T]
	5	F. Bry, Query evaluation in recursive databases: bottom-up and top-down reconciled, Data & Knowledge Engineering, v.5 n.4, p.289-312, Oct. 1990 [doi>10.1016/0169-023X(90)90017-8]
	6	Saumya K. Debray , David S. Warren, Automatic mode inference for logic programs, Journal of Logic Programming, v.5 n.3, p.207-229, Sept. 1988 [doi>10.1016/0743-1066(88)90010-6]
	7	Dietrich, S.W. and Warren, D.S. Extension tables' Memo relations in Department of Computer Science, SUNY at Stony Brook, Mar., 1986.
	8	Jay Earley, An efficient context-free parsing algorithm, Communications of the ACM, v.13 n.2, p.94-102, Feb 1970 [doi>10.1145/362007.362035]
	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,
	10	Timothy J. Hickey , Donald A. Smith, Toward the partial evaluation of CLP languages, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.43-51, June 17-19, 1991, New Haven, Connecticut, United States
	11	Kanamori, T. and Kawamura, T. Abstract interpretation Based on OhDT-Resolution. ICOT Tech. Rep., 1990.
	12	Komorowski, J. A specification of an Abstract Prolog Machine and its application to partial evaluation. 1981.
	13	Kowalski, R. Logic for Problem Soiv- 1979.
	14	Kursawe, P. How to invent a Protog (1987).
	15	J. W. Lloyd, Foundations of logic programming, Springer-Verlag New York, Inc., New York, NY, 1984
	16	J. W. Lloyd , J. C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming, v.11 n.3-4, p.217-242, Oct./Nov. 1991 [doi>10.1016/0743-1066(91)90027-M]
	17	David Maier , David S. Warren, Computing with logic: logic programming with Prolog, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1988
	18	Kim Marriott , Harald Søndergaard , Philip Dart, A characterization of non-floundering logic programs, Proceedings of the 1990 North American conference on Logic programming, p.661-680, January 1990, Austin, Texas, United States
	19	Mellish, C. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, Eds. Abstract In- Ellis Horwood, (1987) pp. 181-198.
	20	Michie, D. Memo functions and machine learning. Nature 2i8, (t968) pp. 19-22.
	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.
	22	S. Naqvi , S. Tsur, A logical language for data and knowledge bases, Computer Science Press, Inc., New York, NY, 1989
	23	Ulf Nilsson, Abstract interpretation: a kind of magic, Selected papers of the symposium on Programming language implementation and logic programming, p.125-138, May 1995, Passau, Germany
	24	Niisson, U. Towards a methodology for the design of abstract machines of logic programming languages. To be published in j. Logic Program.
	25	Pereira, F.C.N. and Warren, D.H.D. Definite clause grammars for language analysis. Ariif inieil. 13, (1980) 23 t-278.
	26	Fernando C. N. Pereira , David H. D. Warren, Parsing as deduction, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts [doi>10.3115/981311.981338]
	27	Raghu Ramakrishnan, Magic templates: a spellbinding approach to logic programs, Journal of Logic Programming, v.11 n.3-4, p.189-216, Oct./Nov. 1991 [doi>10.1016/0743-1066(91)90026-L]
	28	J Rohmer , R Lescoeur , J M Kerisit, The Alexander method-a technique for the processing of recursive axioms in deductive databases, New Generation Computing, v.4 n.3, p.273-285, 1986 [doi>10.1007/BF03037407]
	29	Yehoshua Sagiv, Is there anything better than magic, Proceedings of the 1990 North American conference on Logic programming, p.235-254, January 1990, Austin, Texas, United States
	30	Dan Sahlin, The Mixtus approach to automatic partial evaluation of full Prolog, Proceedings of the 1990 North American conference on Logic programming, p.377-398, January 1990, Austin, Texas, United States
	31	H. Seki, On the power of Alexander templates, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.150-159, March 1989, Philadelphia, Pennsylvania, United States [doi>10.1145/73721.73737]
	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.
	33	Sterling, L. and Shapiro, E. The Art of Prolog. MiT Press, Cambridge, Mass., ISBN 0-262-19250-0, 1986, p. 427.
	34	Hisao Tamaki , Taisuke Sato, OLD resolution with tabulation, Proceedings on Third international conference on logic programming, p.84-98, September 1986, London, United Kingdom
	35	Jeffrey D. Ullman, Principles of database and knowledge-base systems, Vol. I, Computer Science Press, Inc., New York, NY, 1988
	36	J. D. Ullman, Bottom-up beats top-down for datalog, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.140-149, March 1989, Philadelphia, Pennsylvania, United States [doi>10.1145/73721.73736]
	37	M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
	38	L. Vielle, Recursive query processing: the power of logic, Theoretical Computer Science, v.69 n.1, p.1-53, Dec. 5, 1989 [doi>10.1016/0304-3975(89)90088-1]
	39	David Scott Warren, Syntax and semantics in parsing: an application to montague grammar., 1979
	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.
	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.

CITED BY 34

	Norman Neff, A logic programming environment for teaching mathematical concepts of computer science, ACM SIGCSE Bulletin, v.25 n.1, p.20-24, March 1993
	Suzanne W. Dietrich, Shortest path by approximation in logic programs, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.2, p.119-137, June 1992
	Konstantinos Sagonas , Michael Leuschel, Extending partial deduction to tabled execution: some results and open issues, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Michael Kifer , Georg Lausen , James Wu, Logical foundations of object-oriented and frame-based languages, Journal of the ACM (JACM), v.42 n.4, p.741-843, July 1995
	Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Solving shape-analysis problems in languages with destructive updating, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.1-50, Jan. 1998
	Colin Bell , Anil Nerode , Raymond T. Ng , V. S. Subrahmanian, Implementing deductive databases by mixed integer programming, ACM Transactions on Database Systems (TODS), v.21 n.2, p.238-269, June 1996
	Konstantinos Sagonas , Terrance Swift , David S. Warren, XSB as an efficient deductive database engine, ACM SIGMOD Record, v.23 n.2, p.442-453, June 1994
	Lunjin Lu, A precise type analysis of logic programs, Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.214-225, September 20-23, 2000, Montreal, Quebec, Canada
	Kotagiri Ramamohanarao , James Harland, An introduction to deductive database languages and systems, The VLDB Journal — The International Journal on Very Large Data Bases, v.3 n.2, April 1994
	W. Litwin , T. Risch, Main Memory Orientated Optimization of OO Queries Using Typed Datalog with Foreign Predicates, IEEE Transactions on Knowledge and Data Engineering, v.4 n.6, p.517-528, December 1992
	Yi-Dong Shen , Li-Yan Yuan , Jia-Huai You, Loop checks for logic programs with functions, Theoretical Computer Science, v.266 n.1-2, p.441-461, 09/06/2001
	Neng-Fa Zhou , Taisuke Sato, Efficient fixpoint computation in linear tabling, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, p.275-283, August 27-29, 2003, Uppsala, Sweden
	Neng-Fa Zhou , Yi-Dong Shen , Taisuke Sato, Semi-naive evaluation in linear tabling, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.90-97, August 24-26, 2004, Verona, Italy
	F. Nihan Kesim , Marek Sergot, A Logic Programming Framework for Modeling Temporal Objects, IEEE Transactions on Knowledge and Data Engineering, v.8 n.5, p.724-741, October 1996
	Gertjan van Noord, An efficient implementation of the head-corner parser, Computational Linguistics, v.23 n.3, p.425-456, September 1997
	Gertjan van Noord, The intersection of finite state automata and definite clause grammars, Proceedings of the 33rd annual meeting on Association for Computational Linguistics, p.159-165, June 26-30, 1995, Cambridge, Massachusetts
	Alexander Pretschner , Heiko Lötzbeyer , Jan Philipps, Model based testing in incremental system development, Journal of Systems and Software, v.70 n.3, p.315-329, March 2004
	Mark Johnson , Jochen Dörre, Memoization of coroutined constraints, Proceedings of the 33rd annual meeting on Association for Computational Linguistics, p.100-107, June 26-30, 1995, Cambridge, Massachusetts
	Diptikalyan Saha , C. R. Ramakrishnan, Incremental and demand-driven points-to analysis using logic programming, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.117-128, July 11-13, 2005, Lisbon, Portugal
	Thomas Reps , Stefan Schwoon , Somesh Jha , David Melski, Weighted pushdown systems and their application to interprocedural dataflow analysis, Science of Computer Programming, v.58 n.1-2, p.206-263, October 2005
	Sara Cohen , Benny Kimelfeld , Yehoshua Sagiv, Incorporating constraints in probabilistic XML, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 09-12, 2008, Vancouver, Canada
	Slim Abdennadher , Christophe Rigotti, Automatic generation of CHR constraint solvers, Theory and Practice of Logic Programming, v.5 n.4-5, p.403-418, July 2005
	S. Adali , K. S. Candan , Y. Papakonstantinou , V. S. Subrahmanian, Query caching and optimization in distributed mediator systems, ACM SIGMOD Record, v.25 n.2, p.137-146, June 1996
	Yi-Dong Shen , Li-Yan Yuan , Jia-Huai You, SLT-Resolution for the Well-Founded Semantics, Journal of Automated Reasoning, v.28 n.1, p.53-97, January 2002
	Baudouin Le Charlier , Sabina Rossi , Pascal Van Hentenryck, Sequence-based abstract interpretation of Prolog, Theory and Practice of Logic Programming, v.2 n.1, p.25-84, January 2002
	Yi-Dong Shen , Li-Yan Yuan , Jia-Huai You , Neng-Fa Zhou, Linear tabulated resolution based on Prolog control strategy, Theory and Practice of Logic Programming, v.1 n.1, p.71-103, January 2001
	Ricardo Caferra , Nicolas Peltier, A New Technique for Verifying and Correcting Logic Programs, Journal of Automated Reasoning, v.19 n.3, p.277-318, December 1997
	Benny Kimelfeld , Yuri Kosharovsky , Yehoshua Sagiv, Query efficiency in probabilistic XML models, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, June 09-12, 2008, Vancouver, Canada
	Lunjin Lu, Improving precision of type analysis using non-discriminative union, Theory and Practice of Logic Programming, v.8 n.1, p.33-79, January 2008
	Neng-fa Zhou , Taisuke Sato , Yi-dong Shen, Linear tabling strategies and optimizations, Theory and Practice of Logic Programming, v.8 n.1, p.81-109, January 2008
	Senlin Liang , Paul Fodor , Hui Wan , Michael Kifer, OpenRuleBench: an analysis of the performance of rule engines, Proceedings of the 18th international conference on World wide web, April 20-24, 2009, Madrid, Spain
	Paul Fodor, Optimizations and extensions for the horn transaction logic programs, Proceedings of the 23rd national conference on Artificial intelligence, p.1849-1850, July 13-17, 2008, Chicago, Illinois
	Taisuke Sato , Yoshitaka Kameya, Parameter learning of logic programs for symbolic-statistical modeling, Journal of Artificial Intelligence Research, v.15 n.1, p.391-454, July 2001
	Paul Fodor, Querying sequential and concurrent horn transaction logic programs using tabling techniques, Proceedings of the 23rd national conference on Artificial intelligence, p.1800-1801, July 13-17, 2008, Chicago, Illinois