{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:54:32Z","timestamp":1725562472669},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_13","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"432-452","source":"Crossref","is-referenced-by-count":1,"title":["On the Inference of Natural Level Mappings"],"prefix":"10.1007","author":[{"given":"Jonathan C.","family":"Martin","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3\/4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K.R. Apt","year":"1991","unstructured":"Apt, K.R., Bezem, M.: Acyclic Programs. New Generation Computing\u00a09(3\/4), 335\u2013364 (1991)","journal-title":"New Generation Computing"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedreschi, D.: Reasoning about Termination of Pure Prolog Programs. Information and Computation\u00a0106(1), 109\u2013157 (1993)","journal-title":"Information and Computation"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/oso\/9780198538530.003.0004","volume-title":"Advances in Logic Programming Theory","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Pedreschi, D.: Modular Termination Proofs for Logic and Pure Prolog programs. In: Levi, G. (ed.) Advances in Logic Programming Theory, pp. 183\u2013229. Oxford University Press, Oxford (1994); Also available as technical report CS-R9316 from Centrum voor Wiskunde en Informatica, CWI, Amesterdam"},{"key":"13_CR4","first-page":"69","volume-title":"North American Conference on Logic Programming","author":"M. Bezem","year":"1989","unstructured":"Bezem, M.: Characterizing Termination of Logic Programs with Level Mappings. In: Lusk, E.L., Overbeek, R.A. (eds.) North American Conference on Logic Programming, pp. 69\u201380. MIT Press, Cambridge (1989)"},{"issue":"1&2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-1066(93)90014-8","volume":"15","author":"M. Bezem","year":"1993","unstructured":"Bezem, M.: Strong Termination of Logic Programs. The Journal of Logic Programming\u00a015(1&2), 79\u201397 (1993)","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1017\/S1471068402001382","volume":"2","author":"A. Bossi","year":"2002","unstructured":"Bossi, A., Cocco, N., Etalle, S., Rossi, S.: On Modular Termination Proofs of General Logic Programs. Theory and Practice of Logic Programming\u00a02(3), 263\u2013291 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"13_CR7","first-page":"321","volume-title":"Joint International Conference and Symposium on Logic Programming","author":"F. Bronsard","year":"1992","unstructured":"Bronsard, F., Lakshman, T.K., Reddy, U.S.: A Framework of Directionality for Proving Termination of Logic Programs. In: Apt, K.R. (ed.) Joint International Conference and Symposium on Logic Programming, pp. 321\u2013335. MIT Press, Cambridge (1992)"},{"issue":"1\/2\/3&4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. The Journal of Logic Programming\u00a010(1\/2\/3&4), 91\u2013124 (1991)","journal-title":"The Journal of Logic Programming"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-45789-5_33","volume-title":"Static Analysis","author":"M. Bruynooghe","year":"2002","unstructured":"Bruynooghe, M., Codish, M., Genaim, S., Vanhoof, W.: Reuse of Results in Termination Analysis of Typed Logic Programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 477\u2013492. Springer, Heidelberg (2002)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0053561","volume-title":"Programming Languages and Systems","author":"M. Bruynooghe","year":"1998","unstructured":"Bruynooghe, M., Leuchel, M., Sagonas, K.F.: A Polyvariant Binding-time Analysis for Off-line Partial Deduction. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 27\u201341. Springer, Heidelberg (1998)"},{"key":"13_CR11","first-page":"571","volume-title":"International Conference on Logic Programming","author":"L. Cavedon","year":"1989","unstructured":"Cavedon, L.: Continuity, consistency, and completeness properties of logic programs. In: Levi, G., Martelli, M. (eds.) International Conference on Logic Programming, pp. 571\u2013584. MIT Press, Cambridge (1989)"},{"key":"13_CR12","first-page":"481","volume-title":"International Conference on Fifth Generation Computer Systems","author":"D. Schreye De","year":"1992","unstructured":"De Schreye, D., Verschaetse, K., Bruynooghe, M.: A Framework for Analysing the Termination of Definite Logic Programs with Respect to Call Patterns. In: International Conference on Fifth Generation Computer Systems, pp. 481\u2013488. IOS Press, Amsterdam (1992)"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"78","DOI":"10.7551\/mitpress\/4299.003.0012","volume-title":"International Conference on Logic Programming","author":"S. Decorte","year":"1997","unstructured":"Decorte, S., De Schreye, D.: Demand-driven and constraint-based automatic left-termination analysis of logic programs. In: Naish, L. (ed.) International Conference on Logic Programming, pp. 78\u201392. MIT Press, Cambridge (1997)"},{"key":"13_CR14","first-page":"235","volume-title":"Joint International Conference and Symposium on Logic Programming","author":"S. Decorte","year":"1998","unstructured":"Decorte, S., De Schreye, D.: Termination analysis: Some practical properties of the Norm and Level Mapping Space. In: Jaffar, J. (ed.) Joint International Conference and Symposium on Logic Programming, pp. 235\u2013249. MIT Press, Cambridge (1998)"},{"key":"13_CR15","first-page":"420","volume-title":"International Logic Programming Symposium","author":"S. Decorte","year":"1993","unstructured":"Decorte, S., De Schreye, D., Fabris, M.: Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. In: Miller, D. (ed.) International Logic Programming Symposium, pp. 420\u2013436. MIT Press, Cambridge (1993)"},{"issue":"6","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1145\/330643.330645","volume":"21","author":"S. Decorte","year":"1999","unstructured":"Decorte, S., De Schreye, D., Vandecasteele, H.: Constraint-based Termination Analysis of Logic Programs. ACM Transactions on Programming Languages and Systems\u00a021(6), 1137\u20131195 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR17","first-page":"29","volume-title":"Symposium on Logic Programming","author":"P. Dembi\u0144ski","year":"1985","unstructured":"Dembi\u0144ski, P., Maluszy\u0144ski, J.: And-Parallelism with Intelligent Backtracking for Annotated Logic Programs. In: Symposium on Logic Programming, pp. 29\u201338. IEEE Press, Los Alamitos (1985)"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0743-1066(98)10025-0","volume":"38","author":"S. Etalle","year":"1999","unstructured":"Etalle, S., Bossi, A., Cocco, N.: Termination of Well-Moded Programs. The Journal of Logic Programming\u00a038(2), 243\u2013257 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-47813-2_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Genaim","year":"2002","unstructured":"Genaim, S., Codish, M., Gallagher, J.P., Lagoon, V.: Combining Norms to Prove Termination. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 126\u2013138. Springer, Heidelberg (2002)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-24599-5_18","volume-title":"Logic Programming","author":"V. Lagoon","year":"2003","unstructured":"Lagoon, V., Mesnard, F., Stuckey, P.: Termination Analysis with Types is More Accurate. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 254\u2013268. Springer, Heidelberg (2003)"},{"key":"13_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.: Foundations of Logic Programming. Springer, Heidelberg (1987)"},{"key":"13_CR22","unstructured":"Martin, J.C.: Judgement Day: Terminating Logic Programs. PhD thesis, Department of Electronics and Computer Science, University of Southampton (2000)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-62718-9_13","volume-title":"Logic Program Synthesis and Transformation","author":"J.C. Martin","year":"1997","unstructured":"Martin, J.C., King, A., Soper, P.: Typed Norms for Typed Logic Programs. In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 224\u2013238. Springer, Heidelberg (1997)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-46562-6_9","volume-title":"Perspectives of System Informatics","author":"J.C. Martin","year":"2000","unstructured":"Martin, J.C., Leuschel, M.: Sonic Partial Deduction. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol.\u00a01755, pp. 101\u2013112. Springer, Heidelberg (2000)"},{"issue":"1-3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0743-1066(98)10035-3","volume":"39","author":"D. Pedreschi","year":"1999","unstructured":"Pedreschi, D., Ruggieri, S.: Verification of Logic Programs. The Journal of Logic Programming\u00a039(1-3), 125\u2013176 (1999)","journal-title":"The Journal of Logic Programming"},{"volume-title":"Handbook of Theoretical Computer Science","year":"1990","key":"13_CR26","unstructured":"Van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, vol.\u00a0B. Elsevier, Amsterdam (1990)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45607-4_8","volume-title":"Logic Based Program Synthesis and Transformation","author":"W. Vanhoof","year":"2002","unstructured":"Vanhoof, W., Bruynooghe, M.: When size does matter. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 129\u2013147. Springer, Heidelberg (2002)"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/371282.371357","volume":"2","author":"S. Verbaeten","year":"2001","unstructured":"Verbaeten, S., De Schreye, D., Sagonas, K.F.: Termination Proofs for Logic Programs with Tabling. ACM Transactions on Computational Logic\u00a02(1), 57\u201392 (2001)","journal-title":"ACM Transactions on Computational Logic"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T01:16:30Z","timestamp":1711674990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}