{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T02:32:19Z","timestamp":1750473139966},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0004-3702(89)90012-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"237-248","source":"Crossref","is-referenced-by-count":14,"title":["On the existence of nonterminating queries for a restricted class of PROLOG-clauses"],"prefix":"10.1016","volume":"41","author":[{"given":"Danny","family":"de Schreye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristof","family":"Verschaetse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(89)90012-X_BIB1","series-title":"Proceedings Fifth Generation Computer Systems","first-page":"149","article-title":"Some practical properties of logic programming interpreters","author":"Brough","year":"1984"},{"key":"10.1016\/0004-3702(89)90012-X_BIB2","series-title":"Logic Programming","first-page":"173","article-title":"Prolog and infinite trees","author":"Colmerauer","year":"1982"},{"key":"10.1016\/0004-3702(89)90012-X_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"17","author":"Courcelle","year":"1983","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0004-3702(89)90012-X_BIB4","series-title":"Ph.D. Thesis","article-title":"Les graphes orient\u00e9s ponder\u00e9s: Un outils pour la programmation logic","author":"Devienne","year":"1987"},{"key":"10.1016\/0004-3702(89)90012-X_BIB5","series-title":"Proceedings Fifth Generation Computer Systems","first-page":"397","article-title":"Weighted graphs: a tool for expressing the behaviour of recursive rules in Logic Programming","author":"Devienne","year":"1988"},{"key":"10.1016\/0004-3702(89)90012-X_BIB6","series-title":"CAAP '86","first-page":"100","article-title":"Weighted graph: A tool for logic programming","volume":"214","author":"Devienne","year":"1986"},{"key":"10.1016\/0004-3702(89)90012-X_BIB7","series-title":"Research Rept. Mitsubishi Electric Corporation","article-title":"Detecting termination of logic programs based on abstract hybrid interpretation","author":"Kanamori","year":"1988"},{"key":"10.1016\/0004-3702(89)90012-X_BIB8","series-title":"Ph.D. Thesis","article-title":"Contribution \u00e0 l'\u00e9tude de la programmation logic par les graphes orient\u00e9s ponder\u00e9s","author":"Lebegue","year":"1987"},{"issue":"1","key":"10.1016\/0004-3702(89)90012-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0306-4379(83)90024-8","article-title":"On recursive axioms in deductive databases","volume":"8","author":"Minker","year":"1983","journal-title":"Inf. Syst."},{"key":"10.1016\/0004-3702(89)90012-X_BIB10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0743-1066(85)90017-2","article-title":"Automating control for logic programs","volume":"2","author":"Naish","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0004-3702(89)90012-X_BIB11","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\/0004-3702(89)90012-X_BIB12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","article-title":"Efficient tests for top-down termination of logical rules","volume":"35","author":"Ullman","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(89)90012-X_BIB13","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"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437028990012X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437028990012X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:22:43Z","timestamp":1553646163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437028990012X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["000437028990012X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(89)90012-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}