{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:54Z","timestamp":1761611094951,"version":"3.44.0"},"reference-count":41,"publisher":"Elsevier BV","issue":"1-2","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":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7596,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0743-1066(92)90045-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:13:42Z","timestamp":1034277222000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["Proving termination properties of prolog programs: A semantic approach"],"prefix":"10.1016","volume":"14","author":[{"given":"Marianne","family":"Baudinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(92)90045-5_BIB1","first-page":"353","article-title":"On the Safe Termination of Prolog Programs","author":"Apt","year":"1989","journal-title":"Sixth International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(92)90045-5_BIB2","series-title":"Proceedings of the Symposium on Computational Logic","article-title":"Studies in Pure Prolog: Termination","author":"Apt","year":"1990"},{"issue":"3","key":"10.1016\/0743-1066(92)90045-5_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"},{"key":"10.1016\/0743-1066(92)90045-5_BIB4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0743-1066(87)90008-2","article-title":"Operational and Denotational Semantics of Prolog","volume":"4","author":"Arbab","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90045-5_BIB5","series-title":"Technical Report CS-R8739","article-title":"Semantics for Prolog via Term Rewrite Systems","author":"Baeten","year":"1987"},{"issue":"1","key":"10.1016\/0743-1066(92)90045-5_BIB6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/321864.321875","article-title":"Proving Theorems about LISP Functions","volume":"22","author":"Boyer","year":"1975","journal-title":"J. ACM"},{"year":"1979","series-title":"A Computational Logic","author":"Boyer","key":"10.1016\/0743-1066(92)90045-5_BIB7"},{"key":"10.1016\/0743-1066(92)90045-5_BIB8","series-title":"Technical Report DoC 86\/16","article-title":"The Treatment of Loops in Logic Programming","author":"Brough","year":"1986"},{"key":"10.1016\/0743-1066(92)90045-5_BIB9","first-page":"149","article-title":"Some Practical Properties of Logic Programming Interpreters","author":"Brough","year":"1984","journal-title":"International Conference on Fifth Generation Computer Systems"},{"key":"10.1016\/0743-1066(92)90045-5_BIB10","series-title":"Formal Description of Programming Concepts-II","first-page":"125","article-title":"Fixed Point Theory for Communication and Concurrency","author":"Broy","year":"1983"},{"issue":"2","key":"10.1016\/0743-1066(92)90045-5_BIB11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1137\/0213026","article-title":"Recursive Programs as Definitions in First Order Logic","volume":"13","author":"Cartwright","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-1066(92)90045-5_BIB12","first-page":"68","article-title":"First Order Programming Logic","author":"Cartwright","year":"1979","journal-title":"Sixth ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(92)90045-5_BIB13","article-title":"Recursive Programs as Functions in a First Order Theory","author":"Cartwright","year":"1979","journal-title":"Proceedings of the 1978 International Conference on Mathematical Studies of Information Processing"},{"key":"10.1016\/0743-1066(92)90045-5_BIB14","first-page":"939","article-title":"A First Order Theory of Data and Programs","author":"Clark","year":"1977","journal-title":"Information Processing 77, Proceedings of IFIP Congress 77"},{"key":"10.1016\/0743-1066(92)90045-5_BIB15","series-title":"IBM Seminar","article-title":"A Theory of Programs","author":"de Bakker","year":"1969"},{"key":"10.1016\/0743-1066(92)90045-5_BIB16","series-title":"Technical Report IR-166","article-title":"Comparative Semantics for Prolog with Cut","author":"de Vink","year":"1989"},{"issue":"1","key":"10.1016\/0743-1066(92)90045-5_BIB17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0743-1066(88)90007-6","article-title":"Denotational and Operational Semantics for Prolog","volume":"5","author":"Debray","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90045-5_BIB18","first-page":"162","article-title":"An Operational Formal Definition of Prolog","author":"Deransart","year":"1987","journal-title":"International Symposium on Logic Programming"},{"issue":"2","key":"10.1016\/0743-1066(92)90045-5_BIB19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0743-1066(85)90014-7","article-title":"A Deterministic Prolog Fixpoint Semantics","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90045-5_BIB20","series-title":"Logics of Programs","first-page":"89","article-title":"Proving Termination of Prolog Programs","author":"Francez","year":"1985"},{"year":"1984","series-title":"Introduction to Logic Programming","author":"Hogger","key":"10.1016\/0743-1066(92)90045-5_BIB21"},{"key":"10.1016\/0743-1066(92)90045-5_BIB22","series-title":"Technical Report AIM-168","article-title":"Admissibility of Fixed-Point Induction in First-Order Logic of Typed Theories","author":"Igarashi","year":"1972"},{"key":"10.1016\/0743-1066(92)90045-5_BIB23","first-page":"281","article-title":"Stepwise Development of Operational and Denotational Semantics for Prolog","author":"Jones","year":"1984","journal-title":"International Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(92)90045-5_BIB24","article-title":"EKL\u2014A Mathematically Oriented Proof Checker","author":"Ketonen","year":"1984","journal-title":"Seventh International Conference on Automated Deduction"},{"key":"10.1016\/0743-1066(92)90045-5_BIB25","series-title":"Technical Report STAN-CS-84-1006","article-title":"EKL\u2014An Interactive Proof Checker User's Reference Manual","author":"Ketonen","year":"1984"},{"issue":"3","key":"10.1016\/0743-1066(92)90045-5_BIB26","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","article-title":"Fixed Point Theorems and Semantics: A Folk Tale","volume":"14","author":"Lassez","year":"1982","journal-title":"Inform. Process. Letters"},{"year":"1974","series-title":"Mathematical Theory of Computation","author":"Manna","key":"10.1016\/0743-1066(92)90045-5_BIB27"},{"issue":"1","key":"10.1016\/0743-1066(92)90045-5_BIB28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6423(81)90004-6","article-title":"Deductive Synthesis of the Unification Algorithm","volume":"1","author":"Manna","year":"1981","journal-title":"Sci. Comput. Programming"},{"volume":"Vol. II","year":"1989","author":"Manna","key":"10.1016\/0743-1066(92)90045-5_BIB29"},{"key":"10.1016\/0743-1066(92)90045-5_BIB30","article-title":"Representation of Recursive Programs in First Order Logic","author":"McCarthy","year":"1977","journal-title":"Draft Manuscript"},{"key":"10.1016\/0743-1066(92)90045-5_BIB31","series-title":"Course Notes","article-title":"LISP, Programming and Proving","author":"McCarthy","year":"1984"},{"issue":"5","key":"10.1016\/0743-1066(92)90045-5_BIB32","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/362588.362598","article-title":"Another Recursion Induction Principle","volume":"14","author":"Morris","year":"1971","journal-title":"C. ACM"},{"key":"10.1016\/0743-1066(92)90045-5_BIB33","series-title":"NPL Report DITC 106\/88","article-title":"A Denotational Definition of Prolog","author":"North","year":"1988"},{"key":"10.1016\/0743-1066(92)90045-5_BIB34","series-title":"Machine Intelligence, 5","first-page":"59","article-title":"Fixpoint Induction and Proofs of Program Properties","author":"Park","year":"1969"},{"year":"1987","series-title":"Logic and Computation: Interactive Proof with Cambridge LCF","author":"Paulson","key":"10.1016\/0743-1066(92)90045-5_BIB35"},{"issue":"8","key":"10.1016\/0743-1066(92)90045-5_BIB36","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"},{"issue":"1","key":"10.1016\/0743-1066(92)90045-5_BIB37","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A Machine-Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(92)90045-5_BIB38","series-title":"Fundamentals of Artificial Intelligence","first-page":"75","article-title":"An Introduction to Automated Deduction","author":"Stickel","year":"1986"},{"issue":"4","key":"10.1016\/0743-1066(92)90045-5_BIB39","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0743-1066(92)90045-5_BIB40","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\/0743-1066(92)90045-5_BIB41","first-page":"140","article-title":"Characterisation of Terminating Logic Programs","author":"Vasak","year":"1986","journal-title":"International Symposium on Logic Programming"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106692900455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106692900455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:01Z","timestamp":1757514481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106692900455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0743106692900455"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(92)90045-5","relation":{},"ISSN":["0743-1066"],"issn-type":[{"type":"print","value":"0743-1066"}],"subject":[],"published":{"date-parts":[[1992,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Proving termination properties of prolog programs: A semantic approach","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-1066(92)90045-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}