{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:56:58Z","timestamp":1649084218718},"reference-count":38,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"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":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00167-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:38:29Z","timestamp":1027636709000},"page":"221-246","source":"Crossref","is-referenced-by-count":0,"title":["Loop checking in SLD-derivations by well-quasi-ordering of goals"],"prefix":"10.1016","volume":"238","author":[{"given":"Giuliano","family":"Pacini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria I.","family":"Sessa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00167-4_BIB1","first-page":"493","article-title":"Logic programming","volume":"vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB2","series-title":"Proc. Seventh Int. Conf. on Logic Programming","first-page":"617","article-title":"Acyclic programs","author":"Apt","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(98)00167-4_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1993.1051","article-title":"Reasoning about termination of pure Prolog programs","volume":"106","author":"Apt","year":"1993","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.1016\/S0304-3975(98)00167-4_BIB4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0743-1066(96)00119-7","article-title":"Magic sets with full sharing","volume":"30","author":"Azevedo","year":"1997","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB5","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv, J.D. Ullman, Magic sets and other strange ways to implement logic programs, in: Proc. ACM Symp. on Principles of Database Systems, 1986, pp. 1\u201315.","DOI":"10.1145\/6012.15399"},{"issue":"3\u20134","key":"10.1016\/S0304-3975(98)00167-4_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","article-title":"On the power of magic","volume":"10","author":"Beeri","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB7","unstructured":"Ph. Besnard, On infinite loops in logic programming, Report 488, IRISA, Rennes, 1989."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(93)90014-8","article-title":"Strong termination of logic programs","volume":"15","author":"Bezem","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","article-title":"An analysis of loop checking mechanism for logic programs","volume":"86","author":"Bol","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90164-B","article-title":"Generalizing completeness results for loop checks in logic programming","volume":"104","author":"Bol","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00167-4_BIB11","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":"2","key":"10.1016\/S0304-3975(98)00167-4_BIB12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(92)00019-N","article-title":"Norms on terms and their use in proving universal termination of a logic program","volume":"124","author":"Bossi","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB13","unstructured":"D.R. Brough, A. Walker, Some practical properties of Logic Programming Interpreters, in: Proc. Internat. Conf. on 5th Generation Computer Systems (1984) 149\u2013156."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0169-023X(90)90017-8","article-title":"Query evaluation in recursive databases: bottom up and top down reconciled","volume":"5","author":"Bry","year":"1990","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"issue":"1","key":"10.1016\/S0304-3975(98)00167-4_BIB15","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"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB16","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB17","unstructured":"S.W. Dietrich, Extension tables: memo relations in logic programming, in: Proc. Symp. on Logic Programming (1987) 264\u2013272."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB18","unstructured":"F. Ferrucci, G. Pacini, M.I. Sessa, Loop checking for reduced SLD-derivations, in: Proc. GULP-PRODE\u201994, vol. I, 1994, pp. 388\u2013402."},{"issue":"2","key":"10.1016\/S0304-3975(98)00167-4_BIB19","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(98)00167-4_BIB20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0743-1066(87)90020-3","article-title":"Efficient loop detection in Prolog using the tortoise-and-hare technique","volume":"4","author":"van Gelder","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB21","series-title":"Foundations of Deductive and Logic Programming","first-page":"149","article-title":"Negation as failure using tight derivations for general Logic Programming","author":"van Gelder","year":"1988"},{"issue":"3","key":"10.1016\/S0304-3975(98)00167-4_BIB22","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952","journal-title":"Proc. London Math. Soc."},{"issue":"3","key":"10.1016\/S0304-3975(98)00167-4_BIB23","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/321958.321960","article-title":"Resolution strategies as decision procedures","volume":"23","author":"Joyner","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB24","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"issue":"3\u20134","key":"10.1016\/S0304-3975(98)00167-4_BIB25","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":"4","key":"10.1016\/S0304-3975(98)00167-4_BIB26","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1145\/322276.322278","article-title":"Deleting repeated goals in the problem reduction format","volume":"28","author":"Loveland","year":"1981","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(98)00167-4_BIB27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0743-1066(95)00090-9","article-title":"On termination of general logic programs w.r.t. constructive negation","volume":"26","author":"Marchiori","year":"1996","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0305004100038603","article-title":"On well-quasi-ordering transfinite sequences","volume":"61","author":"Nash-Williams","year":"1965","journal-title":"Proc. Cambridge Phil. Soc."},{"issue":"8","key":"10.1016\/S0304-3975(98)00167-4_BIB29","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/988346.988350","article-title":"On eliminating loops in Prolog","volume":"20","author":"Poole","year":"1985","journal-title":"SIGPLAN Notices"},{"issue":"3\u20134","key":"10.1016\/S0304-3975(98)00167-4_BIB30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0743-1066(91)90026-L","article-title":"Magic templates: a spellbinding approach to logic programs","volume":"11","author":"Ramakrishnan","year":"1991","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/S0304-3975(98)00167-4_BIB31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(94)00039-9","article-title":"A survey of deductive database systems","volume":"23","author":"Ramakrishnan","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB32","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/BF03037407","article-title":"The Alexander method \u2013 a technique for the processing of the recursive axioms in deductive database queries","volume":"4","author":"Rohmer","year":"1986","journal-title":"New generation Comput."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB33","doi-asserted-by":"crossref","unstructured":"H. Seki, On the power of Alexander templates, in: Proc. North American Conf. of Databases Systems, 1989, pp. 150\u2013159.","DOI":"10.1145\/73721.73737"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB34","first-page":"84","article-title":"OLD Resolution with Tabulation","volume":"vol. 225","author":"Tamaki","year":"1986"},{"key":"10.1016\/S0304-3975(98)00167-4_BIB35","unstructured":"L. Vieille, Database complete proof procedures based on SLD-resolution, in: Proc. 4th Internat. Conf. on Logic Programming, 1987, pp. 74\u2013103."},{"issue":"1","key":"10.1016\/S0304-3975(98)00167-4_BIB36","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."},{"key":"10.1016\/S0304-3975(98)00167-4_BIB37","doi-asserted-by":"crossref","unstructured":"B. Wang, R.K. Shyamasundar, A methodology for proving the termination of logic programs, in: Proc. STACS\u201991, 1991, pp. 214\u2013227.","DOI":"10.1007\/BFb0020800"},{"issue":"3","key":"10.1016\/S0304-3975(98)00167-4_BIB38","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":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001674?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001674?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:09:02Z","timestamp":1580857742000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598001674"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00167-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}