{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:09:22Z","timestamp":1648710562078},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NGCO"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf03037235","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T01:58:39Z","timestamp":1240365519000},"page":"141-162","source":"Crossref","is-referenced-by-count":3,"title":["On the completeness of naive memoing in Prolog"],"prefix":"10.1007","volume":"15","author":[{"given":"Suzanne Wagner","family":"Dietrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changguan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037235_CR1","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J., \u201cMagic Sets and Other Strange Ways to Implement Logic Programs,\u201dSymposium on Principles of Database Systems, ACM, pp. 1\u201315, 1986.","DOI":"10.1145\/6012.15399"},{"key":"BF03037235_CR2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan, R., \u201cAn Amateur\u2019s Introduction to Recursive Query Processing Strategies,\u201dSIGMOD, ACM, pp. 1\u201315, 1986.","DOI":"10.1145\/16856.16859"},{"issue":"4","key":"BF03037235_CR3","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","volume":"12","author":"R. S. Bird","year":"1980","unstructured":"Bird, R. S., \u201cTabulation Techniques for Recursive Programs,\u201dComputing Surveys, 12, 4, pp. 403\u2013417, 1980.","journal-title":"Computing Surveys"},{"key":"BF03037235_CR4","doi-asserted-by":"crossref","unstructured":"Bry, F., \u201cQuery Evaluation in Deductive Databases: Bottom-up and Top-down Reconciled,\u201dProceedings of the First International Conference on Deductive and Object-Oriented Databases, pp. 25\u201344, December 1989.","DOI":"10.1016\/B978-0-444-88433-6.50010-1"},{"key":"BF03037235_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W. and Warren, D. S., \u201cQuery Evaluation under the Well-Founded Semantics,\u201dSymposium on Principles of Database Systems, ACM, pp. 168\u2013179, 1993.","DOI":"10.1145\/153850.153865"},{"key":"BF03037235_CR6","unstructured":"Dietrich, S. W., \u201cExtension Tables: Memo Relations in Logic Programming,\u201dSymposium on Logic Programming, IEEE, pp. 264\u2013272, 1987."},{"issue":"2","key":"BF03037235_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/151333.151377","volume":"1","author":"S. W. Dietrich","year":"1992","unstructured":"Dietrich, S. W., \u201cShortest Path by Approximation in Logic Programming,\u201dACM Letters on Programming Languages and Systems, 1, 2, pp. 119\u2013137, June 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"BF03037235_CR8","unstructured":"Fagin, B. S. and Despain, A. M., \u201cGoal Caching in Prolog,\u201dHawaiian International Conference on System Sciences, IEEE, pp. 277\u2013281, 1986."},{"key":"BF03037235_CR9","doi-asserted-by":"crossref","unstructured":"Fan, C. and Dietrich, S. W., \u201cExtension Table Built-ins for Prolog,\u201dSoftware Practice and Experience, pp. 573\u2013597, July 1992.","DOI":"10.1002\/spe.4380220706"},{"key":"BF03037235_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., \u201cCompilation-Based List Processing in Deductive Databases,\u201dthe International Conference on Extending Database Technology, pp. 104\u2013119, March 1992.","DOI":"10.1007\/BFb0032426"},{"issue":"1","key":"BF03037235_CR11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/5001.5004","volume":"8","author":"R. M. Keller","year":"1986","unstructured":"Keller, R. M., \u201cApplicative Caching,\u201dACM Transactions on Programming Languages and Systems, 8, 1, pp. 88\u2013108, January 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03037235_CR12","doi-asserted-by":"crossref","unstructured":"Kifer, M., \u201cOn Safety, Domain Independence and Capturability of Database Queries,\u201dProc. of the 3rd International Conference on Data and Knowledge Bases: Improving Usability and Responsiveness, IPA and ACM, pp. 405\u2013415, June, 1988.","DOI":"10.1016\/B978-1-4832-1313-2.50037-8"},{"key":"BF03037235_CR13","unstructured":"Lindholm, T. G. and O\u2019Keefe, R. A., \u201cEfficient Implementation of a Defensible Semantics for Dynamic Prolog Cod,\u201dProc. of the International Conference on Logic Programming, ACM, pp. 21\u201339, 1987."},{"key":"BF03037235_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, 2nd edition, Springer-Verlag, New York, NY, 1987.","edition":"2nd edition"},{"key":"BF03037235_CR15","doi-asserted-by":"crossref","unstructured":"Naughton, J. F., \u201cOne-Sided Recursion,\u201dSymposium on Principles of Database Systems, ACM, pp. 340\u2013348, 1987.","DOI":"10.1145\/28659.28695"},{"key":"BF03037235_CR16","doi-asserted-by":"crossref","unstructured":"Naughton, J. F., Ramakrishnan, R., Sagiv, Y., and Ullman, J. D., \u201cEfficient Evaluation of Right-, Left-, and Multi-Linear Rules,\u201dSIGMOD, ACM, pp. 235\u2013242, 1989.","DOI":"10.1145\/66926.66948"},{"key":"BF03037235_CR17","doi-asserted-by":"crossref","unstructured":"Ramakrishnan R., Bancilhon, F., and Silberschatz, A., \u201cSafety of Recursive Horn Clauses with Infinite Relations,\u201dSymposium on Principles of Database Systems, ACM, pp. 328\u2013339, 1987.","DOI":"10.1145\/28659.28694"},{"key":"BF03037235_CR18","doi-asserted-by":"crossref","unstructured":"Sagonas, K., Swift, T., and Warren, D. S., \u201cXSB as an Efficient Deductive Database Engine,\u201dProc. of the 1994 ACM SIGMOD International Conference on the Management of Data, ACM, pp. 442\u2013453, 1994.","DOI":"10.1145\/191839.191927"},{"key":"BF03037235_CR19","unstructured":"Tamaki, H. and Sato, T., \u201cUnfold\/Fold Transformation of Logic Programs,\u201dProc. of the International Conference on Logic Programming, ACM, pp. 127\u2013138, July 1984."},{"key":"BF03037235_CR20","doi-asserted-by":"crossref","unstructured":"Tamaki, H. and Sato, T., \u201cOLD Resolution with Tabulation,\u201dProc. of the International Conference on Logic Programming, ACM, pp. 84\u201398, July 1986.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"BF03037235_CR21","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J. D. Ullman","year":"1988","unstructured":"Ullman, J. D.,Principles of Database and Knowledge-Base Systems, Vol. 1. Computer Science Press, Rockville, Md, 1988."},{"key":"BF03037235_CR22","volume-title":"Principles of Database and Knowledge-Base Systems, Vol. 2: The New Technologies","author":"J. D. Ullman","year":"1989","unstructured":"Ullman, J. D.,Principles of Database and Knowledge-Base Systems, Vol. 2: The New Technologies, Computer Science Press, Rockville, Md, 1989."},{"key":"BF03037235_CR23","unstructured":"Vieille, L., \u201cA Database-Complete Proof Procedure Based on SLD-Resolution,\u201dProc. of the International Conference on Logic Programming, ACM, pp. 74\u2013103, 1987."},{"key":"BF03037235_CR24","unstructured":"Warren, D. S., \u201cThe XWAM: A Machine that Integrates Prolog and Database Query Evaluation,\u201dArchitecture Workshop of the North American Conference on Logic Programming, ALP, 1990."},{"issue":"3","key":"BF03037235_CR25","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/131295.131299","volume":"35","author":"D. S. Warren","year":"1992","unstructured":"Warren, D. S., \u201cMemoing for Logic Programs,\u201dCommunications of the ACM, 35, 3, ACM, pp. 94\u2013111, March 1992.","journal-title":"Communications of the ACM"},{"key":"BF03037235_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, W. and Yu, C. T., \u201cA Necessary Condition for a Double Recursive Rule to Be Equivalent to a Linear Recursive Rule,\u201dSIGMOD, ACM, pp. 345\u2013356, 1987.","DOI":"10.1145\/38714.38751"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037235.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037235\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:32Z","timestamp":1558572752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF03037235"],"URL":"https:\/\/doi.org\/10.1007\/bf03037235","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}