{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:02:27Z","timestamp":1794344547204,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676287","type":"print"},{"value":"9783540451488","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720327_10","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T12:52:22Z","timestamp":1167396742000},"page":"156-175","source":"Crossref","is-referenced-by-count":3,"title":["Transformation of Left Terminating Programs"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"Bossi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicoletta","family":"Cocco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandro","family":"Etalle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"617","volume-title":"Proceedings of the Seventh International Conference on Logic Programming","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R., Bezem, M.: Acyclic programs. In: Warren, D.H.D., Szeredi, P. (eds.) Proceedings of the Seventh International Conference on Logic Programming, pp. 617\u2013633. The MIT Press, Cambridge (1990)"},{"issue":"6A","key":"10_CR2","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/BF01213601","volume":"6","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Marchiori, E.: Reasoning about Prolog programs: from Modes through Types to Assertions. Formal Aspects of Computing\u00a06(6A), 743\u2013765 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-76274-1_9","volume-title":"Symposium on Computional Logic","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R., Pedreschi, D.: Studies in pure Prolog: termination. In: Lloyd, J.W. (ed.) Symposium on Computional Logic, Berlin, pp. 150\u2013176. Springer, Heidelberg (1990)"},{"issue":"1","key":"10_CR4","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":"10_CR5","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice Hall, Englewood Cliffs (1997)"},{"key":"10_CR6","unstructured":"Baudinet, M.: Logic Programming Semantics: Techniques and Applications. PhD thesis, Stanford University, Stanford, California (1989)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-58431-5_19","volume-title":"Algebraic and Logic Programming","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Cocco, N.: Preserving universal termination through unfold\/fold. In: Rodr\u00edguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol.\u00a0850, pp. 269\u2013286. Springer, Heidelberg (1994)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-62718-9_7","volume-title":"Logic Program Synthesis and Transformation","author":"A. Bossi","year":"1997","unstructured":"Bossi, A., Cocco, N.: Replacement Can Preserve Termination. In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 104\u2013129. Springer, Heidelberg (1997)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-49674-2_2","volume-title":"Logic Program Synthesis and Transformation","author":"A. Bossi","year":"1998","unstructured":"Bossi, A., Cocco, N.: Programs without failures. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 28\u201348. Springer, Heidelberg (1998)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-48958-4_12","volume-title":"Logic-Based Program Synthesis and Transformation","author":"A. Bossi","year":"1999","unstructured":"Bossi, A., Cocco, N.: Successes in logic programs. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol.\u00a01559, pp. 219\u2013239. Springer, Heidelberg (1999)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-60939-3_3","volume-title":"Logic Program Synthesis and Transformation","author":"A. Bossi","year":"1996","unstructured":"Bossi, A., Cocco, N., Etalle, S.: Transformation of Left Terminating Programs: the Reordering Problem. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 33\u201345. Springer, Heidelberg (1996)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1145\/183432.183434","volume":"16","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Etalle, S.: Transforming Acyclic Programs. ACM Transactions on Programming Languages and Systems\u00a016(4), 1081\u20131096 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1&2","key":"10_CR13","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. Journal of Logic Programming\u00a015(1&2), 79\u201397 (1993)","journal-title":"Journal of Logic Programming"},{"key":"10_CR14","first-page":"571","volume-title":"6 International Conference on Logic Programming","author":"L. Cavedon","year":"1989","unstructured":"Cavedon, L.: Continuity, consistency and completeness properties for logic programs. In: Levi, G., Martelli, M. (eds.) 6 International Conference on Logic Programming, pp. 571\u2013584. MIT press, Cambridge (1989)"},{"key":"10_CR15","volume-title":"Proc. Fourth Workshop on Logic Program Synthesis and Transformation","author":"J. Cook","year":"1994","unstructured":"Cook, J., Gallagher, J.P.: A transformation system for definite programs based on termination analysis. In: Turini, F. (ed.) Proc. Fourth Workshop on Logic Program Synthesis and Transformation. Springer, Heidelberg (1994)"},{"key":"10_CR16","unstructured":"Dembinski, P., Maluszynski, J.: AND-parallelism with intelligent backtracking for annotated logic programs. In: Proceedings of the International Symposium on Logic Programming, Boston, pp. 29\u201338 (1985)"},{"issue":"2","key":"10_CR17","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. Journal of Logic Programming\u00a038(2), 243\u2013257 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(95)00148-4","volume":"166","author":"S. Etalle","year":"1996","unstructured":"Etalle, S., Gabbrielli, M.: Transformations of CLP modules. Theoretical Computer Science\u00a0166(1), 101\u2013146 (1996)","journal-title":"Theoretical Computer Science"},{"key":"10_CR19","unstructured":"Jones, N., Mycroft, A.: Stepwise Development of Operational and Denotational Semantics for Prolog. In: T\u00e4rnlund, S.-\u00c5. (ed.) Proc. Second Int\u2019l Conf. on Logic Programming, pp. 281\u2013288 (1984)"},{"issue":"1&2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(90)90065-P","volume":"75","author":"T. Kawamura","year":"1990","unstructured":"Kawamura, T., Kanamori, T.: Preservation of Stronger Equivalence in Unfold\/ Fold Logic Programming Transformation. Theoretical Computer Science\u00a075(1&2), 139\u2013156 (1990)","journal-title":"Theoretical Computer Science"},{"key":"10_CR21","volume-title":"Foundations of Logic Programming. Symbolic Computation \u2013 Artificial Intelligence","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Symbolic Computation \u2013 Artificial Intelligence, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J.W. Lloyd","year":"1991","unstructured":"Lloyd, J.W., Shepherdson, J.C.: Partial Evaluation in Logic Programming. Journal of Logic Programming\u00a011, 217\u2013242 (1991)","journal-title":"Journal of Logic Programming"},{"key":"10_CR23","volume-title":"ACM SIGPLAN Symposium on Partial Evaluation and Semantics- Based Program Manipulation (PEPM 1991)","author":"M. Proietti","year":"1991","unstructured":"Proietti, M., Pettorossi, A.: Semantics preserving transformation rules for prolog. In: ACM SIGPLAN Symposium on Partial Evaluation and Semantics- Based Program Manipulation (PEPM 1991). ACM Press, New York (1991)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H. Seki","year":"1991","unstructured":"Seki, H.: Unfold\/fold transformation of stratified programs. Theoretical Computer Science\u00a086(1), 107\u2013139 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","volume":"16","author":"H. Seki","year":"1993","unstructured":"Seki, H.: Unfold\/fold transformation of general logic programs for the Well- Founded semantics. Journal of Logic Programming\u00a016(1&2), 5\u201323 (1993)","journal-title":"Journal of Logic Programming"},{"key":"10_CR26","unstructured":"Tamaki, H., Sato, T.: Unfold\/Fold Transformations of Logic Programs. In: T\u00e4rnlund, S.-\u00c5. (ed.) Proc. Second Int\u2019l Conf. on Logic Programming, pp. 127\u2013139 (1984)"}],"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\/10720327_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T22:23:27Z","timestamp":1552861407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720327_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676287","9783540451488"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/10720327_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/10720327","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}