{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T02:32:14Z","timestamp":1750473134135},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0304-3975(00)00197-3","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:53:12Z","timestamp":1036101192000},"page":"441-461","source":"Crossref","is-referenced-by-count":9,"title":["Loop checks for logic programs with functions"],"prefix":"10.1016","volume":"266","author":[{"given":"Yi-Dong","family":"Shen","sequence":"first","affiliation":[]},{"given":"Li-Yan","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00197-3_BIB1","unstructured":"R.N. Bol, Towards more efficient loop checks, in: S. Debray, M. Hermenegildo (Eds.), Proc. 1990 North American Conf. on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 343\u2013358."},{"key":"10.1016\/S0304-3975(00)00197-3_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0743-1066(93)90022-9","article-title":"Loop checking in partial deduction","volume":"16","author":"Bol","year":"1993","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/S0304-3975(00)00197-3_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","article-title":"An analysis of loop checking mechanisms for logic programs","volume":"86","author":"Bol","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00197-3_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0743-1066(97)00073-3","article-title":"Tabulated resolution for the Well-Founded semantics","volume":"34","author":"Bol","year":"1998","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/S0304-3975(00)00197-3_BIB5","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/227595.227597","article-title":"Tabled evaluation with delaying for general logic programs","volume":"43","author":"Chen","year":"1996","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(00)00197-3_BIB6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/988284.988288","article-title":"Eliminating unwanted loops in Prolog","volume":"20","author":"Covington","year":"1985","journal-title":"SIGPLAN Notices"},{"issue":"8","key":"10.1016\/S0304-3975(00)00197-3_BIB7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/988346.988348","article-title":"A further note on loops in Prolog","volume":"20","author":"Covington","year":"1985","journal-title":"SIGPLAN Notices"},{"issue":"20","key":"10.1016\/S0304-3975(00)00197-3_BIB8","first-page":"199","article-title":"Termination of logic programs: the never-ending story","volume":"19","author":"De Schreye","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/inco.1995.1082","article-title":"Redundancy elimination and loop checks for logic programs","volume":"119","author":"Ferrucci","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00197-3_BIB10","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","article-title":"Partial evaluation in logic programming","volume":"11","author":"Lloyd","year":"1991","journal-title":"J. Logic Programming"},{"issue":"8","key":"10.1016\/S0304-3975(00)00197-3_BIB12","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/988346.988350","article-title":"On eliminating loops in Prolog","volume":"20","author":"Pool","year":"1985","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB13","unstructured":"K. Sagonas, T. Swift, D.S. Warren, J. Freire, P. Rao, The XSB Programmer's Manual, Version 1.8, Department of Computer Science, SUNY at Stony Brook, 1998. Available from http:\/\/www.cs.sunysb.edu\/sbprolog\/xsb-page.html."},{"key":"10.1016\/S0304-3975(00)00197-3_BIB14","unstructured":"D. Sahlin, The mixtus approach to automatic partial evaluation of full Prolog, in: S. Debray, M. Hermenegildo (Eds.), Proc. 1990 North American Conf. on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 377\u2013398."},{"issue":"1","key":"10.1016\/S0304-3975(00)00197-3_BIB15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","article-title":"Mixtus","volume":"12","author":"Sahlin","year":"1993","journal-title":"New Generation Comput."},{"issue":"3","key":"10.1016\/S0304-3975(00)00197-3_BIB16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF03037486","article-title":"Verifying local stratifiability of logic programs and databases II","volume":"14","author":"Shen","year":"1996","journal-title":"New Generation Comput."},{"issue":"2","key":"10.1016\/S0304-3975(00)00197-3_BIB17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF03037237","article-title":"An extended variant of atoms loop check for positive logic programs","volume":"15","author":"Shen","year":"1997","journal-title":"New Generation Comput."},{"key":"10.1016\/S0304-3975(00)00197-3_BIB18","doi-asserted-by":"crossref","unstructured":"Y.D. Shen, L.Y. Yuan, J.H. You, N.F. Zhou, Linear tabulated resolution for the well founded semantics, in: M. Gelfond, N. Leone, G. Pfeifer (Eds.), Proc. 5th Internat. Conf. on Logic Programming and Nonmonotonic Reasoning, Springer, Berlin, 1999, pp. 192\u2013205.","DOI":"10.1007\/3-540-46767-X_14"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB19","doi-asserted-by":"crossref","unstructured":"Y.D. Shen, L.Y. Yuan, J.H. You, N.F. Zhou, Linear tabulated resolution based on Prolog control strategy, Theory and Practice of Logic Programming 1 (1) (2001).","DOI":"10.1017\/S1471068400001010"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FI-1997-31207","article-title":"An abstract approach to some loop detection problems","volume":"31","author":"Skordev","year":"1997","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00197-3_BIB21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(86)90003-2","article-title":"Controlling recursive inference","volume":"30","author":"Smith","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB22","doi-asserted-by":"crossref","unstructured":"H. Tamaki, T. Sato, OLD resolution with tabulation, in: E. Shapiro, Proceedings of the 3rd Internat. Conf. on Logic Programming, Springer, Berlin, 1986, pp. 84\u201398.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0743-1066(87)90020-3","article-title":"Efficient loop detection in Prolog","volume":"4","author":"Van Gelder","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","article-title":"Recursive query processing: the power of logic","volume":"69","author":"Vieille","year":"1989","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(00)00197-3_BIB25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/131295.131299","article-title":"Memoing for logic programs","volume":"35","author":"Warren","year":"1992","journal-title":"CACM"},{"issue":"1","key":"10.1016\/S0304-3975(00)00197-3_BIB26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03037527","article-title":"A general criterion for avoiding infinite unfolding during partial deduction","volume":"11","author":"Bruynooghe","year":"1992","journal-title":"New Generation Computing"},{"issue":"2","key":"10.1016\/S0304-3975(00)00197-3_BIB27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(95)00149-2","article-title":"Automatic finite unfolding using well-founded measures","volume":"28","author":"Martens","year":"1996","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0304-3975(00)00197-3_BIB28","unstructured":"B. Martens, D. De Schreye, M. Bruynooghe, Sound and complete partial deduction with unfolding based on well-founded measures, in: H. Tanaka (Ed.), Proc. of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, IOS Press 1992, pp. 473\u2013480."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T10:00:01Z","timestamp":1578909601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0304397500001973"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00197-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}