{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:45:47Z","timestamp":1649133947201},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":7594,"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":[[1992,10]]},"DOI":"10.1016\/0304-3975(92)90164-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"3-28","source":"Crossref","is-referenced-by-count":3,"title":["Generalizing completeness results for loop checks in logic programming"],"prefix":"10.1016","volume":"104","author":[{"given":"Roland N.","family":"Bol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90164-B_BIB1","first-page":"493","article-title":"Logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(92)90164-B_BIB2","series-title":"Proc. 6th Internat. Conf. on Logic Programming","first-page":"353","article-title":"On the safe termination of PROLOG programs","author":"Apt","year":"1989"},{"key":"10.1016\/0304-3975(92)90164-B_BIB3","series-title":"Internal Report 488","article-title":"On infinite loops in logic programming","author":"Besnard","year":"1989"},{"key":"10.1016\/0304-3975(92)90164-B_BIB4_1","series-title":"Technical Report CS-R9075","article-title":"Loop checking and negation","author":"Bol","year":"1990"},{"key":"10.1016\/0304-3975(92)90164-B_BIB4_2","series-title":"Logics in AI","first-page":"121","volume":"Vol. 478","year":"1991"},{"key":"10.1016\/0304-3975(92)90164-B_BIB5","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."},{"key":"10.1016\/0304-3975(92)90164-B_BIB6","first-page":"149","article-title":"Some practical properties of logic programming interpreters","author":"Brough","year":"1984","journal-title":"Proc. Internat. Conf. on 5th Generation Computer Systems"},{"key":"10.1016\/0304-3975(92)90164-B_BIB7","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\/0304-3975(92)90164-B_BIB8","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\/0304-3975(92)90164-B_BIB9","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(92)90164-B_BIB10","series-title":"Technical Report CS-87-09","article-title":"Partial evaluation in logic programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(92)90164-B_BIB11","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(92)90164-B_BIB12","series-title":"Proc. 6th ACM Symposium on Principles of Database Systems","first-page":"340","article-title":"One-sided recursion","author":"Naughton","year":"1987"},{"key":"10.1016\/0304-3975(92)90164-B_BIB13","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"},{"key":"10.1016\/0304-3975(92)90164-B_BIB14","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\/0304-3975(92)90164-B_BIB15","series-title":"Logic Colloquium \u201986","first-page":"319","article-title":"A complete class of restricted logic programs","author":"\u0160t\u011bp\u00e1nkov\u00e1","year":"1988"},{"key":"10.1016\/0304-3975(92)90164-B_BIB16","doi-asserted-by":"crossref","unstructured":"H. Tamaki and T. Sato, OLD resolution with tabulation, in: G. Goos and J. Hartmanis, eds., Proc. 3rd Internat. Conf. on Logic Programming, Lecture Notes in Computer Science, Vol. 225 (Springer, Berlin, 186) 84\u201398.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"10.1016\/0304-3975(92)90164-B_BIB17","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290164B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290164B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:20:27Z","timestamp":1555129227000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290164B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["030439759290164B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90164-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}