{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T22:26:28Z","timestamp":1672698388955},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5678,"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":[[1998,1]]},"DOI":"10.1016\/s0743-1066(97)00028-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"1-41","source":"Crossref","is-referenced-by-count":12,"title":["Transformational methodology for proving termination of logic programs"],"prefix":"10.1016","volume":"34","author":[{"given":"M.R.K.","family":"Krishna Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.K.","family":"Shyamasundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)00028-9_BIB1","series-title":"Proc. 13th Conf. Foundations Software Technol. Theoret. Comput. Sci. (FST&TCS'93)","first-page":"114","article-title":"Proving Termination of Logic Program by Transforming Them into Equivalent Term Rewriting Systems","volume":"761","author":"Aguzzi","year":"1993"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB2","first-page":"493","article-title":"Logic Programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB3","series-title":"Proc. MFCS'93","first-page":"1","article-title":"On the Unification Free Prolog Programs","volume":"711","author":"Apt","year":"1993"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB4","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":"Information Computation"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB5","article-title":"Termination of Logic Programs via Labelled Term Rewrite Systems","author":"Arts","year":"1994"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB6","first-page":"1","article-title":"Proving Termination Properties of Prolog Programs: A Semantic Approach","volume":"15","author":"Baudinet","year":"1988"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB7","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":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB8","series-title":"Proc. TAPSOFT'91","first-page":"153","article-title":"Proving Termination of Logic Programs by Exploiting Term Properties","volume":"494","author":"Bossi","year":"1991"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB9","series-title":"A Transformation from Logic Programs to Term Rewrite Systems and Its Application to Termination, draft","author":"Chtourou","year":"1993"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF03037115","article-title":"AND Parallelism and Nondeterminism in Logic Programming","volume":"3","author":"Conery","year":"1985","journal-title":"New Generation Comput."},{"key":"10.1016\/S0743-1066(97)00028-9_BIB11","series-title":"Proc. RTA'89","first-page":"109","article-title":"Simulation of Turing Machines by a Left-Linear Rewrite Rule","volume":"355","author":"Dauchet","year":"1989"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB12","article-title":"Termination Analysis of Definite Logic Programs with Respect to Call Patterns","author":"De Schreye","year":"1992"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB13","first-page":"481","article-title":"A Framework for Analyzing the Termination of Definite Logic Programs","author":"De Schreye","year":"1992"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","article-title":"Termination of Logic Programs: The Never-Ending Story","volume":"19\/20","author":"De Schreye","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","article-title":"Automatic Mode Inference for Logic Programs","volume":"5","author":"Debray","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB16","article-title":"And-Parallelism with Intelligent Backtracking for Annotated Logic Programs","author":"Dembinski","year":"1985"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for Term-Rewriting Systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"TCS"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Terminiation of Rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symb. Comp."},{"key":"10.1016\/S0743-1066(97)00028-9_BIB19","first-page":"243","article-title":"Rewrite Systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB20","series-title":"Proc. Logics Programs","first-page":"89","article-title":"Proving Termination of Prolog Programs","volume":"193","author":"Francez","year":"1985"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB21","series-title":"Proc. CTRS'92","first-page":"430","article-title":"Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems","volume":"656","author":"Ganzinger","year":"1992"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB22","series-title":"Two Generalizations of Recursive Path Ordering","author":"Kamin","year":"1980"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB23","series-title":"Proc. RTA'89","first-page":"559","article-title":"An Overview of Rewrite Rule Laboratory (RRL)","author":"Kapur","year":"1989"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB24","series-title":"Proc. Comput. Sci. Logic, CSL'91","first-page":"213","article-title":"A Transformational Methodology for Proving Termination of Logic Programs","volume":"626","author":"Krishna Rao","year":"1991"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB25","series-title":"Proc. 5th Symp. Formal Methods Europe, FME'93","first-page":"442","article-title":"Verification Tools in the Development of Provably Correct Compilers","volume":"670","author":"Krishna Rao","year":"1993"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB26","series-title":"Proc. Static Analysis Symp., SAS'95","first-page":"243","article-title":"Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs","volume":"983","author":"Krishna Rao","year":"1994"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB27","series-title":"Proc. 10th ACM POPL'83","first-page":"99","article-title":"Computer Experiments with the REVE Term Rewriting Systems Generator","author":"Lescanne","year":"1983"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB28","series-title":"Proc. Algebraic Logic Prog., ALP'92","first-page":"21","article-title":"Termination of Rewriting Systems by Elementary Interpretations","volume":"632","author":"Lescanne","year":"1992"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB29","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB30","series-title":"Proc. Algebraic Logic Prog. ALP '94","first-page":"223","article-title":"Logic Programs as Term Rewriting Systems","volume":"850","author":"Marchiori","year":"1994"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB31","series-title":"Proc. Int. Symp. Logic Programming, ILPS '94","article-title":"Localizations of Unification Freedom Trough Matching Directions","author":"Marchiori","year":"1994"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB32","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52837-7","article-title":"Termination Proofs for Logic Programs","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB33","series-title":"Proc. ILPS'91","first-page":"503","article-title":"Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms","author":"Pl\u00fcmer","year":"1991"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB34","series-title":"Proc. ALPUK'92 Conf. Workshops in Computing Series","first-page":"3","article-title":"Rewriting Concepts in the Study of Termination of Logic Programs","author":"Shyamasundar","year":"1990"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB35","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":"JACM"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB36","first-page":"140","article-title":"Characterization of Terminating Logic Programs","author":"Vasak","year":"1986"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB37","article-title":"Static Termination Analysis for Definite Horn Clause Logic Programs","author":"Verschaetse","year":"1992"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB38","series-title":"Proc. PLILP'90","first-page":"203","article-title":"Towards a Characterization of Termination of Logic Programs","volume":"456","author":"Wang","year":"1990"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB39","series-title":"Proc. STACS'91","first-page":"214","article-title":"Methodology for Proving the Termination of Logic Programs","volume":"480","author":"Wang","year":"1991"},{"key":"10.1016\/S0743-1066(97)00028-9_BIB40","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","article-title":"Termination of Term Rewriting by Semantic Labelling","volume":"24","author":"Zantema","year":"1995","journal-title":"Fundamenta Informaticae"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T12:31:18Z","timestamp":1578486678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697000289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0743106697000289"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)00028-9","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}