{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:49Z","timestamp":1747546909630},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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,3]]},"DOI":"10.1016\/s0304-3975(99)00155-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:01:16Z","timestamp":1027627276000},"page":"273-296","source":"Crossref","is-referenced-by-count":6,"title":["\u2203-Universal termination of logic programs"],"prefix":"10.1016","volume":"254","author":[{"given":"Salvatore","family":"Ruggieri","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00155-3_BIB1","first-page":"493","article-title":"Logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(99)00155-3_BIB2","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. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(99)00155-3_BIB3","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"issue":"1 & 2","key":"10.1016\/S0304-3975(99)00155-3_BIB4","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(99)00155-3_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"8","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(99)00155-3_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","article-title":"Termination of logic programs","volume":"19\u201320","author":"De Schreye","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB7","doi-asserted-by":"crossref","unstructured":"P. Devienne, P. Leb\u00e8gue, J.C. Routier. Halting problem of one binary horn clause is undecidable, STACS\u201993, Lecture Notes in Computer Science, Vol. 665, Springer, Berlin, 1993, pp. 48\u201357.","DOI":"10.1007\/3-540-56503-5_7"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB8","series-title":"The G\u00f6del Programming Language","author":"Hill","year":"1994"},{"issue":"7","key":"10.1016\/S0304-3975(99)00155-3_BIB9","first-page":"424","volume":"22","author":"Kowalski","year":"1979","journal-title":"Algorithms = Logic + Control. Comm. ACM"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closure and fairness in the semantics of logic programming","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00155-3_BIB11","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB12","series-title":"On termination of logic programs with delay declarations, Proceedings of the 1995 International Symposium on Logic Programming","first-page":"447","author":"Marchiori","year":"1995"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB13","doi-asserted-by":"crossref","unstructured":"J. Martin, A. King, Generating efficient, terminating logic programs, Proceedings of TAPSOFT\u201997, Lecture Notes in Computer Science, Vol. 1214, 1997, pp. 273\u2013284.","DOI":"10.1007\/BFb0030603"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB14","unstructured":"L. Naish, Coroutining and the construction of terminating logic programs, Technical Report 92\/5, Department of Computer Science, University of Melbourne, 1992."},{"key":"10.1016\/S0304-3975(99)00155-3_BIB15","volume":"Vol. 446","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB16","unstructured":"L. Pl\u00fcmer, Automatic verification of parallel logic programs: termination, in: C. Beierle, L. Pl\u00fcmer (Eds.), Logic Programming: Formal Methods and Practical Applications, Elsevier, Amsterdam, 1995, Chapter 3, pp. 91\u2013119."},{"key":"10.1016\/S0304-3975(99)00155-3_BIB17","first-page":"347","article-title":"Decidability of logic program semantics and applications to testing","volume":"Vol. 1140","author":"Ruggieri","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(99)00155-3_BIB18","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF03037949","article-title":"Proving termination of GHC programs","volume":"15","author":"Shyamasundar","year":"1997","journal-title":"New Generation Comput."},{"issue":"1\u20133","key":"10.1016\/S0304-3975(99)00155-3_BIB19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","article-title":"The execution algorithm of Mercury, an efficient purely declarative logic programming language","volume":"29","author":"Somogyi","year":"1996","journal-title":"J. Logic Program."},{"key":"10.1016\/S0304-3975(99)00155-3_BIB20","series-title":"Proceedings of SAS\u201997, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/BFb0032740","article-title":"Termination analysis for mercury","author":"Speirs","year":"1997"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB21","series-title":"The Art of Prolog","author":"Sterling","year":"1992"},{"key":"10.1016\/S0304-3975(99)00155-3_BIB22","unstructured":"J. Thom, J. Zobel, NU-Prolog reference manual, Version 1.3. Technical report, Department of Computer Science, University of Melbourne, Australia, 1988."},{"issue":"1","key":"10.1016\/S0304-3975(99)00155-3_BIB23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0743-1066(85)90005-6","article-title":"Top-down semantics of fair computations of logic programs","volume":"2","author":"van Emden","year":"1985","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001553?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001553?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T22:22:20Z","timestamp":1579126940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001553"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00155-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}