{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:42Z","timestamp":1794381102469,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540227915","type":"print"},{"value":"9783540278641","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27864-1_27","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T12:35:37Z","timestamp":1284640537000},"page":"377-392","source":"Crossref","is-referenced-by-count":1,"title":["Non-termination Inference for Constraint Logic Programs"],"prefix":"10.1007","author":[{"given":"Etienne","family":"Payet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred","family":"Mesnard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","first-page":"293","volume-title":"Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basis for the termination analysis of logic programs. Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"Journal of Logic Programming"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0004-3702(89)90012-X","volume":"41","author":"D. Schreye De","year":"1989","unstructured":"De Schreye, D., Bruynooghe, M., Verschaetse, K.: On the existence of nonterminating queries for a restricted class of Prolog-clauses. Artificial Intelligence\u00a041, 237\u2013248 (1989)","journal-title":"Artificial Intelligence"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19-20","author":"D. Schreye De","year":"1994","unstructured":"De Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. Journal of Logic Programming\u00a019-20, 199\u2013260 (1994)","journal-title":"Journal of Logic Programming"},{"key":"27_CR5","first-page":"649","volume-title":"Proc. of ICLP 1990","author":"D. Schreye De","year":"1990","unstructured":"De Schreye, D., Verschaetse, K., Bruynooghe, M.: A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. In: Proc. of ICLP 1990, pp. 649\u2013663. The MIT Press, Cambridge (1990)"},{"key":"27_CR6","first-page":"394","volume-title":"Proceedings of the ACM Symposium on applied computing","author":"M. Gabbrielli","year":"1994","unstructured":"Gabbrielli, M., Giacobazzi, R.: Goal independency and call patterns in the analysis of logic programs. In: Proceedings of the ACM Symposium on applied computing, pp. 394\u2013399. ACM Press, New York (1994)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Logic for Programming, Artificial intelligence and Reasoning","author":"S. Genaim","year":"2001","unstructured":"Genaim, S., Codish, M.: Inferring termination condition for logic programs using backwards analysis. In: Proceedings of Logic for Programming, Artificial intelligence and Reasoning. LNCS, Springer, Berlin (2001)"},{"key":"27_CR8","first-page":"111","volume-title":"Proc. of the ACM Symposium on Principles of Programming Languages","author":"J. Jaffar","year":"1987","unstructured":"Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proc. of the ACM Symposium on Principles of Programming Languages, pp. 111\u2013119. ACM Press, New York (1987)"},{"issue":"1-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming\u00a037(1-3), 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"key":"27_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)"},{"key":"27_CR11","first-page":"7","volume-title":"Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming","author":"F. Mesnard","year":"1996","unstructured":"Mesnard, F.: Inferring left-terminating classes of queries for constraint logic programs by means of approximations. In: Maher, M.J. (ed.) Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming, pp. 7\u201321. MIT Press, Cambridge (1996)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis","author":"F. Mesnard","year":"2001","unstructured":"Mesnard, F., Neumerkel, U.: Applying static analysis techniques for inferring termination conditions of logic programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 93\u2013110. Springer, Heidelberg (2001)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/3-540-45789-5_35","volume-title":"Static Analysis","author":"F. Mesnard","year":"2002","unstructured":"Mesnard, F., Payet, E., Neumerkel, U.: Detecting optimal termination conditions of logic programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 509\u2013525. Springer, Heidelberg (2002)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Mesnard, F., Ruggieri, S.: On proving left termination of constraint logic programs. ACM Transactions on Computational Logic, 207\u2013259 (2003)","DOI":"10.1145\/635499.635503"},{"key":"27_CR15","first-page":"22","volume-title":"Proc. of the Joint International Conf. and Symposium on Logic Programming","author":"P. Refalo","year":"1996","unstructured":"Refalo, P., Van Hentenryck, P.: CLP (Rlin) revised. In: Maher, M. (ed.) Proc. of the Joint International Conf. and Symposium on Logic Programming, pp. 22\u201336. The MIT Press, Cambridge (1996)"},{"key":"27_CR16","volume-title":"Mathematical Logic","author":"J. Shoenfield","year":"1967","unstructured":"Shoenfield, J.: Mathematical Logic. Addison Wesley, Reading (1967)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27864-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:31:44Z","timestamp":1619998304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_27","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99688","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}