{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:07:57Z","timestamp":1725890877641},"publisher-location":"London","reference-count":20,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198062"},{"type":"electronic","value":"9781447135609"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-1-4471-3560-9_12","type":"book-chapter","created":{"date-parts":[[2012,12,30]],"date-time":"2012-12-30T06:49:46Z","timestamp":1356850186000},"page":"168-183","source":"Crossref","is-referenced-by-count":3,"title":["Automatic Termination Analysis"],"prefix":"10.1007","author":[{"given":"Kristof","family":"Verschaetse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefaan","family":"Decorte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"De Schreye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"KR Apt","year":"1991","unstructured":"K.R. Apt and M. Bezem. Acyclic programs. New Generation Computing, 9: 335\u2013363, 1991.","journal-title":"New Generation Computing"},{"key":"12_CR2","series-title":"Brussels Springer-Verlag","first-page":"150","volume-title":"Proceedings Esprit symposium on computational logic","author":"KR Apt","year":"1990","unstructured":"K.R. Apt and D. Pedreschi. Studies in pure Prolog: termination. In Proceedings Esprit symposium on computational logic, pages 150\u2013176, Brussels, November 1990. Springer-Verlag."},{"key":"12_CR3","volume-title":"Proceedings International Conference on Theoretical Aspects of Computer Science","author":"KR Apt","year":"1991","unstructured":"K.R. Apt and D. Pedreschi. Proving termination of general Prolog programs. In Proceedings International Conference on Theoretical Aspects of Computer Science, Sendai, Japan, 1991."},{"key":"12_CR4","first-page":"69","volume-title":"Proceedings NACLP89y","author":"M Bezem","year":"1989","unstructured":"M. Bezem. Characterizing termination of logic programs with level mappings. In Proceedings NACLP\u201989y pages 69\u201380, 1989."},{"key":"12_CR5","unstructured":"BIM. Prolog by BIM release 3.0."},{"key":"12_CR6","volume-title":"University of Padova","author":"A Bossi","year":"1991","unstructured":"A. Bossi, N. Cocco, and M. Fabris. Norms on terms and their use in proving universal termination of a logic program. Technical Report 4\/29, CNR, Department of Mathematics, University of Padova, March 1991."},{"key":"12_CR7","volume-title":"Technical Report Cw","author":"D Schreye","year":"1992","unstructured":"D. De Schreye and K. Verschaetse. Termination analysis of definite logic programs with respect to call patterns. Technical Report CW 138, Department Computer Science, K.U.Leuven, January 1992."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"D. De Schreye, K. Verschaetse, and M. Bruynooghe. A framework for analysing the termination of definite logic programs with respect to call patterns. In Proceedings FGCS\u201992, Tokyo, June 1992.","DOI":"10.1007\/3-540-56282-6_5"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"S.K. Debray. Static inference of modes and data dependencies in logic programs. ACM transactions on programming languages and systems, ll(3): 418\u2013450, July 1989.","DOI":"10.1145\/65979.65983"},{"key":"12_CR10","unstructured":"Y. Deville. Logic Programming: Systematic Program Development Addison-Wesley, 1990."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behaviour of logic languages. Theoretical Computer Science, 69 (3): 289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","volume-title":"Department of Computer Science","author":"G Janssens","year":"1990","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Technical Report CW 107, Department of Computer Science, K.U.Leuven, March 1990. To appear in Journal of Logic Programming, in print."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1145\/359131.359136","volume":"22","author":"RA Kowalski","year":"1979","unstructured":"R.A. Kowalski. Algorithm = logic + control. Communications of the ACM, 22: 424\u2013431, 1979.","journal-title":"Communications of the Acm"},{"issue":"34","key":"12_CR14","first-page":"217","volume":"11","author":"JW Lloyd","year":"1991","unstructured":"J.W. Lloyd and J.C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11 (3 & 4): 217\u2013242, October\/November 1991.","journal-title":"October\/november"},{"key":"12_CR15","volume-title":"Springer-verlag","author":"L Naish","year":"1986","unstructured":"L. Naish. Negation and control in Prolog. Lecture Notes in Artificial Intelligence 238. Springer-Verlag, 1986."},{"key":"12_CR16","volume-title":"Springer-verlag","author":"L Plumer","year":"1990","unstructured":"L. Plumer. Termination proofs for logic programs. Lecture Notes in Artificial Intelligence 446. Springer-Verlag, 1990."},{"key":"12_CR17","unstructured":"ProloglA. Prolog IIIt release 1.1."},{"key":"12_CR18","first-page":"216","volume-title":"Proceedings 10th symposium on principles of database systems","author":"K Sohn","year":"1991","unstructured":"K. Sohn and A. Van Gelder. Termination detection in logic programs using argument sizes. In Proceedings 10th symposium on principles of database systems, pages 216\u2013226. Acm Press, May 1991."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"JD Ullman","year":"1988","unstructured":"J.D. Ullman and A. Van Gelder. Efficient tests for top-down termination of logical rules. Journal ACM, 35 (2): 345\u2013373, April 1988.","journal-title":"Journal Acm"},{"key":"12_CR20","volume-title":"Technical Report Cw","author":"K Verschaetse","year":"1992","unstructured":"K. Verschaetse and D. De Schreye. Automatic derivation of linear size relations. Technical Report CW 139, Department Computer Science, K.U.Leuven, January 1992."}],"container-title":["Workshops in Computing","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3560-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T18:24:29Z","timestamp":1562523869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3560-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540198062","9781447135609"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3560-9_12","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1993]]}}}