{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:41Z","timestamp":1725561281592},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_45","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"507-508","source":"Crossref","is-referenced-by-count":5,"title":["Termination Analysis of Logic Programs"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Serebrenik","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-45628-7_9","volume-title":"Computational Logic: Logic Programming and Beyond","author":"D. Schreye De","year":"2002","unstructured":"De Schreye, D., Serebrenik, A.: Acceptability with general orderings. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02407, pp. 187\u2013210. Springer, Heidelberg (2002)"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Serebrenik, A.: Termination analysis of logic programs. PhD thesis, Department of Computer Science, K.U. Leuven, Leuven, Belgium (July 2003) xiv++228+x","DOI":"10.1007\/978-3-540-24599-5_45"},{"key":"45_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/3-540-45653-8_45","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Serebrenik","year":"2001","unstructured":"Serebrenik, A., De Schreye, D.: Inference of termination conditions for numerical loops in Prolog. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 654\u2013668. Springer, Heidelberg (2001)"},{"key":"45_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/3-540-45653-8_36","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Serebrenik","year":"2001","unstructured":"Serebrenik, A., De Schreye, D.: On termination of meta-programs. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 517\u2013530. Springer, Heidelberg (2001)"},{"key":"45_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-45789-5_13","volume-title":"Static Analysis","author":"A. Serebrenik","year":"2002","unstructured":"Serebrenik, A., De Schreye, D.: On termination of logic programs with floating point computations. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 151\u2013164. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T07:59:20Z","timestamp":1635839960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}