{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T11:16:07Z","timestamp":1672571767897},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6927,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0743-1066(94)90004-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"1-30","source":"Crossref","is-referenced-by-count":4,"title":["A methodology for proving termination of logic programs"],"prefix":"10.1016","volume":"21","author":[{"given":"Bal","family":"Wang","sequence":"first","affiliation":[]},{"given":"R.K.","family":"Shyamasundar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)90004-3_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF03037168","article-title":"Acyclic programs","volume":"9","author":"Apt","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/0743-1066(94)90004-3_BIB2","series-title":"Proc. Symposium on Computational Logic","first-page":"150","article-title":"Studies in pure Prolog: termination","author":"Apt","year":"1990"},{"key":"10.1016\/0743-1066(94)90004-3_BIB3","series-title":"Handbook of Theoretical Computer Science","first-page":"494","article-title":"Logic programming","author":"Apt","year":"1990"},{"key":"10.1016\/0743-1066(94)90004-3_BIB4","series-title":"Technical Report","article-title":"Reasoning about Termination of Prolog Programs","author":"Apt","year":"1992"},{"key":"10.1016\/0743-1066(94)90004-3_BIB5","first-page":"336","article-title":"Proving termination properties of Prolog programs: a semantic approach","author":"Baudinet","year":"1988","journal-title":"Proc. LICS"},{"key":"10.1016\/0743-1066(94)90004-3_BIB6","first-page":"58","article-title":"A tool to check the non-floundering logic programs and goals","volume":"348","author":"Barbuti","year":"1988"},{"key":"10.1016\/0743-1066(94)90004-3_BIB7","series-title":"Proc. of the North American Conference on Logic Programming","first-page":"69","article-title":"Characterizing termination of logic programs with level mappings","author":"Bezem","year":"1989"},{"key":"10.1016\/0743-1066(94)90004-3_BIB8","series-title":"Ph.D. Thesis","article-title":"Loop Checking in Logic Programming","author":"Bol","year":"1991"},{"key":"10.1016\/0743-1066(94)90004-3_BIB9","first-page":"571","article-title":"Continuity, consistency, and completeness properties for logic programs","author":"Cavedon","year":"1989","journal-title":"Proc. ICLP 89"},{"key":"10.1016\/0743-1066(94)90004-3_BIB10","series-title":"Technical Report CS-87-06","article-title":"A Completeness Theorem for SLDNF-Resolution","author":"Cavedon","year":"1987"},{"key":"10.1016\/0743-1066(94)90004-3_BIB11","series-title":"Symposium on Logic and Data Bases","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(94)90004-3_BIB12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0743-1066(94)90004-3_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","article-title":"Inductive assertion method for logic programs","volume":"59","author":"Drabent","year":"1988","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(94)90004-3_BIB14","article-title":"Termination Analysis of Definite Logic Programs with Respect to Call Patterns","author":"De Schreye","year":"1992","journal-title":"Technical Report"},{"key":"10.1016\/0743-1066(94)90004-3_BIB15","unstructured":"De Schreye, D. and Decorte, S., Termination of LP: The never-ending story, unpublished."},{"key":"10.1016\/0743-1066(94)90004-3_BIB16","first-page":"89","article-title":"Proving termination of Prolog programs","volume":"193","author":"Francez","year":"1985"},{"key":"10.1016\/0743-1066(94)90004-3_BIB17","article-title":"Assigning meanings to programs","volume":"19","author":"Floyd","year":"1967"},{"key":"10.1016\/0743-1066(94)90004-3_BIB18","first-page":"433","article-title":"On logic programs with data-driven computations","volume":"225","author":"Heck","year":"1986","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0743-1066(94)90004-3_BIB19","article-title":"Verification of PROLOG programs using an extension of execution","author":"Kanamori","year":"1987","journal-title":"Proc. of the Third Intern. Conf. on Logic Programming"},{"key":"10.1016\/0743-1066(94)90004-3_BIB20","first-page":"559","article-title":"An overview of rewrite rule laboratory (RRL)","volume":"355","author":"Kapur","year":"1989"},{"key":"10.1016\/0743-1066(94)90004-3_BIB21","first-page":"213","article-title":"A transformational methodology for proving termination of logic programs","volume":"626","author":"Krishna Rao","year":"1992"},{"key":"10.1016\/0743-1066(94)90004-3_BIB22","first-page":"442","article-title":"Verification tools in the development of provably correct compilers","volume":"670","author":"Krishna Rao","year":"1993"},{"key":"10.1016\/0743-1066(94)90004-3_BIB23","article-title":"Signed Data Dependencies in Logic Programs","volume":"719","author":"Kunen","year":"1987"},{"key":"10.1016\/0743-1066(94)90004-3_BIB24","series-title":"Proc. ICLP 93, Budapest","first-page":"720","article-title":"Proving termination of GHC programs","author":"Krishna Rao","year":"1993"},{"key":"10.1016\/0743-1066(94)90004-3_BIB25","series-title":"Proc. 10th ACM POPL","first-page":"99","article-title":"Computer experiments with the REVE term rewriting systems generator","author":"Lescanne","year":"1983"},{"key":"10.1016\/0743-1066(94)90004-3_BIB26","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013817","article-title":"Termination of rewriting systems by elementary interpretations","author":"Lescanne","year":"1992","journal-title":"Proc. Algebraic and Logic Programming"},{"key":"10.1016\/0743-1066(94)90004-3_BIB27","series-title":"Foundation of Logic Programming (revised extended version)","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(94)90004-3_BIB28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","article-title":"A polymorphic type system for Prolog","volume":"23","author":"Mycroft","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(94)90004-3_BIB29","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1982"},{"key":"10.1016\/0743-1066(94)90004-3_BIB30","article-title":"Termination Proofs for Logic Programs, Ph.D. Thesis","volume":"446","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/0743-1066(94)90004-3_BIB31","series-title":"Logic Programming: Functions, Relations, and Equations","article-title":"On the relationship between logic and functional languages","author":"Reddy","year":"1986"},{"key":"10.1016\/0743-1066(94)90004-3_BIB32","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(94)90004-3_BIB33","series-title":"Proc. ALPUK'92 Conference, Workshops in Computing Series","first-page":"3","article-title":"Rewriting concepts in the study of termination of logic programs","author":"Shyamasundar","year":"1992"},{"issue":"2","key":"10.1016\/0743-1066(94)90004-3_BIB34","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\/0743-1066(94)90004-3_BIB35","article-title":"Characterization of terminating logic programs","author":"Vasak","year":"1986","journal-title":"IEEE Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(94)90004-3_BIB36","first-page":"204","article-title":"Towards a characterization of termination of logic programs","volume":"456","author":"Wang","year":"1990"},{"key":"10.1016\/0743-1066(94)90004-3_BIB37","series-title":"Ph.D. Thesis","article-title":"Verification, Termination, and Completeness of Logic Programs","author":"Wang","year":"1990"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:58:11Z","timestamp":1555113491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0743106694900043"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)90004-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}