{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T18:32:05Z","timestamp":1697394725667},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"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":[[1994,2]]},"DOI":"10.1016\/0304-3975(92)00019-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"297-328","source":"Crossref","is-referenced-by-count":33,"title":["Norms on terms and their use in proving universal termination of a logic program"],"prefix":"10.1016","volume":"124","author":[{"given":"A","family":"Bossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N","family":"Cocco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M","family":"Fabris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)00019-N_BIB1","first-page":"493","article-title":"Introduction to logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(92)00019-N_BIB2","series-title":"Proc. Symp. on Computational Logic","first-page":"150","article-title":"Studies in Pure Prolog: termination","volume":"Vol. 1","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(92)00019-N_BIB3","series-title":"Proc. Internat. Conf. on Theoretical Aspects of Computer Science","article-title":"Proving termination of general Prolog programs","author":"Apt","year":"1991"},{"key":"10.1016\/0304-3975(92)00019-N_BIB4","series-title":"Proc. 3rd Ann. Symp. on Logic in Computer Science","first-page":"336","article-title":"Proving termination properties of Prolog programs","author":"Baudinet","year":"1988"},{"key":"10.1016\/0304-3975(92)00019-N_BIB5","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(92)00019-N_BIB6","series-title":"Proc. NACLP '89","first-page":"69","article-title":"Characterizing termination of logic programs","author":"Bezem","year":"1989"},{"key":"10.1016\/0304-3975(92)00019-N_BIB7","series-title":"Proc. TAPSOFT'89, Vol. 2","first-page":"96","article-title":"Verifying correctness of logic programs","volume":"Vol. 352","author":"Bossi","year":"1989"},{"key":"10.1016\/0304-3975(92)00019-N_BIB8","series-title":"Proc. CCPSD-TAPSOFT'91","first-page":"153","article-title":"Proving termination of logic programs by exploiting term properties","volume":"Vol. 494","author":"Bossi","year":"1991"},{"key":"10.1016\/0304-3975(92)00019-N_BIB9","article-title":"Suspension analysis for concurrent logic programs","author":"Codish","year":"1991"},{"key":"10.1016\/0304-3975(92)00019-N_BIB10","series-title":"Proc. ICLP '91","first-page":"629","article-title":"Proving correctness of logic programs using axiomatic semantics","author":"Colussi","year":"1991"},{"key":"10.1016\/0304-3975(92)00019-N_BIB11","series-title":"Proc. FGCS '92","article-title":"A framework for analysing the termination of definite logic programs with respect to call patterns","author":"De Schreye","year":"1992"},{"key":"10.1016\/0304-3975(92)00019-N_BIB12","series-title":"Logic Programming Systematic Program Development","author":"Deville","year":"1990"},{"key":"10.1016\/0304-3975(92)00019-N_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":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)00019-N_BIB14","series-title":"Logics of Programs","first-page":"89","article-title":"Proving termination of Prolog programs","volume":"Vol. 193","author":"Francez","year":"1985"},{"key":"10.1016\/0304-3975(92)00019-N_BIB15","series-title":"Proc. FGCS '92","article-title":"A generalized semantics for constrained logic programs","author":"Giacobazzi","year":"1992"},{"key":"10.1016\/0304-3975(92)00019-N_BIB16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","article-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(92)00019-N_BIB17","series-title":"Proc. ICLP '90","first-page":"634","article-title":"Termination proofs for logic programs based on predicate inequalities","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/0304-3975(92)00019-N_BIB18","article-title":"Termination Proofs for Logic Programs","volume":"Vol. 446","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/0304-3975(92)00019-N_BIB19","series-title":"Proc. ILPS '91","first-page":"503","article-title":"Termination Proofs for Prolog programs operating on nonground terms","author":"Pl\u00fcmer","year":"1991"},{"key":"10.1016\/0304-3975(92)00019-N_BIB20","series-title":"Proc. FGCS '92","article-title":"Automatic verification of GHC-programs: termination","author":"Pl\u00fcmer","year":"1992"},{"key":"10.1016\/0304-3975(92)00019-N_BIB21","series-title":"Proc. of the 10th Internat. Symp. on Principles of Database Systems","article-title":"Termination detection in logic programs using argument sizes","author":"Sohn","year":"1991"},{"issue":"2","key":"10.1016\/0304-3975(92)00019-N_BIB22","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\/0304-3975(92)00019-N_BIB23","series-title":"Proc. Internat. Symp. on Logic Programming '86","first-page":"140","article-title":"Characterisation of terminating logic programs","author":"Vasak","year":"1986"},{"key":"10.1016\/0304-3975(92)00019-N_BIB24","article-title":"Static termination analysis for definite Horn clause programs","author":"Verschaetse","year":"1992"},{"key":"10.1016\/0304-3975(92)00019-N_BIB25","series-title":"Proc. ICLP '91","first-page":"301","article-title":"Deriving termination proofs for logic programs using abstract procedures","author":"Verschaetse","year":"1991"},{"key":"10.1016\/0304-3975(92)00019-N_BIB26","article-title":"Automatic derivation of linear size relations","author":"Verschaetse","year":"1992"},{"key":"10.1016\/0304-3975(92)00019-N_BIB27","series-title":"Perspective in Theoretical Computer Science","first-page":"380","article-title":"Proving termination of logic programs","author":"Wang","year":"1989"},{"key":"10.1016\/0304-3975(92)00019-N_BIB28","series-title":"Proc. PLILP '90","first-page":"204","article-title":"Towards a characterization of termination of logic programs","volume":"Vol. 456","author":"Wang","year":"1990"},{"key":"10.1016\/0304-3975(92)00019-N_BIB29","series-title":"Proc. STACS '91","first-page":"214","article-title":"Methodology for proving the termination of logic programs","author":"Wang","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759200019N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759200019N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:22Z","timestamp":1555129582000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759200019N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["030439759200019N"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)00019-n","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}