{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:33Z","timestamp":1725487653951},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657651"},{"type":"electronic","value":"9783540489580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48958-4_13","type":"book-chapter","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T02:11:42Z","timestamp":1185156702000},"page":"240-254","source":"Crossref","is-referenced-by-count":4,"title":["Inferring and Compiling Termination for Constraint Logic Programs"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Hoarau","sequence":"first","affiliation":[]},{"given":"Fred","family":"Mesnard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"1061","author":"K.R. Apt","year":"1993","unstructured":"K.R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. In Information and Computation, 106:1, pages 109\u2013157, 1993.","journal-title":"In Information and Computation"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of the 6th ICALP","author":"M. Codish","year":"1997","unstructured":"M. Codish and C. Taboch. A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints. Proc. of the 6th ICALP, LNCS 1298, 1997."},{"key":"13_CR3","unstructured":"S. Colin, F. Mesnard, and A. Rauzy. Constraint logic programming and mu-calculus. ERCIM\/COMPULOG Workshop on Constraints, 1997. URL: http:\/\/www.univ-reunion.fr\/~gcc"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13:103\u2013179, 1992.","journal-title":"Journal of Logic Programming"},{"key":"13_CR5","first-page":"1","volume":"12","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, 12:1\u201366, 1994.","journal-title":"Journal of Logic Programming"},{"key":"13_CR6","unstructured":"M. Gabbrielli and G. Levi. Modelling answer constraints in constraint logic programs. In MIT Press, Proc. of ICLP\u201991, pages 238\u2013252, 1991."},{"key":"13_CR7","doi-asserted-by":"publisher","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. Journal of Logic Programming, 19:503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs. In MIT Press, Proc. of the 14th ICLP, pages 63\u201377, 1997.","DOI":"10.7551\/mitpress\/4299.003.0011"},{"key":"13_CR9","unstructured":"F. Mesnard. Inferring left-terminating classes of queries for constraint logic programs by means of approximations. In MIT Press, Proc. of JICSLP\u201996, pages 7\u201321, 1996."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"K. Sohn and A. Van Gelder. Termination detection in logic programs using argument sizes. In ACM Press, Proc. of PODS\u201991, pages 216\u2013226, 1991.","DOI":"10.1145\/113413.113433"},{"key":"13_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of SAS\u201997","author":"C. Speirs","year":"1997","unstructured":"C. Speirs, Z. Somogyi, and H. S\u00f8ndergaard. Termination analysis for Mercury. Proc. of SAS\u201997, LNCS 1302, 1997."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48958-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T00:45:25Z","timestamp":1708130725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48958-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657651","9783540489580"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-48958-4_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}