{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:36Z","timestamp":1725664236598},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:41Z","timestamp":1330280081000},"page":"431-448","source":"Crossref","is-referenced-by-count":4,"title":["On termination of constraint logic programs"],"prefix":"10.1007","author":[{"given":"Livio","family":"Colussi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Marchiori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Marchiori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19","author":"K.R. Apt","year":"1994","unstructured":"K.R. Apt and R. Bol. Logic programming and negation: a survey. JLP 19, 20: 9\u201372, 1994.","journal-title":"JLP"},{"issue":"3\/4","key":"26_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01190828","volume":"5","author":"K.R. Apt","year":"1994","unstructured":"K.R. Apt, E. Marchiori, and C. Palamidessi. A declarative approach for first-order built-in's of Prolog. Applicable Algebra in Engineering, Communication and Computation, 5(3\/4), pp. 159\u2013191, 1994.","journal-title":"Applicable Algebra in Engineering, Communication and Computation"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-50940-2_30","volume":"352","author":"A. Bossi","year":"1989","unstructured":"A. Bossi and N. Cocco. Verifying correctness of logic programs. TAPSOFT, LNCS 352, pp. 96\u2013110, 1989.","journal-title":"TAPSOFT"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(92)00019-N","volume":"124","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, N. Cocco and M. Fabris. Norms on terms and their use in proving universal termination of a logic program. TCS 124: 297\u2013328, 1994.","journal-title":"TCS"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"L. Colussi, E. Marchiori and M. Marchiori. A dataflow semantics for constraint logic programs. In Proceedings of PLILP'95, to appear, 1995.","DOI":"10.1007\/BFb0026834"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","volume":"59","author":"W. Drabent","year":"1988","unstructured":"W. Drabent and J. Maluszy\u0144ski. Inductive assertion method for logic programs. TCS, 59(1):133\u2013155, 1988.","journal-title":"TCS"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. JLP 19, 20: 199\u2013260, 1994.","journal-title":"JLP"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"R.W. Floyd. Assigning meanings to programs. In J.T. Schwartz, editor, Proceedings Symposium in Applied Mathematics, volume 19 of Math. Aspects in Computer Science, pages 19\u201332. AMS, 1967.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. JLP 19, 20: 503\u2013581, 1994.","journal-title":"JLP"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Z. Manna. Termination of Programs Represented as Interpreted Graphs. Proc. Spring. J. Comp. Conf., pp. 83\u201389, 1970.","DOI":"10.1145\/1476936.1476956"},{"key":"26_CR11","unstructured":"F. Mesnard. Etude de la terminaison des programmes logiques avec constraintes aux moyens d'approximations. PhD Thesis, Paris VI, 1993."},{"issue":"1","key":"26_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(94)90004-3","volume":"21","author":"B. Wang","year":"1994","unstructured":"B. Wang and R.K. Shyamasundar. A methodology for proving termination of logic programs. JLP 21(1): 1\u201330, 1994.","journal-title":"JLP"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:55Z","timestamp":1619573815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}