{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:39:39Z","timestamp":1725493179212},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766308"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76631-5_29","type":"book-chapter","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T02:33:07Z","timestamp":1193020387000},"page":"305-315","source":"Crossref","is-referenced-by-count":1,"title":["Improving Efficiency of Prolog Programs by Fully Automated Unfold\/Fold Transformation"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Vysko\u010dil","sequence":"first","affiliation":[]},{"given":"Petr","family":"\u0160t\u011bp\u00e1nek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1996","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination in rewriting. Journal of Symbolic Computation\u00a03, 69\u2013116 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"De Schreye, D., Gl\u00fcck, R., J\u00f8rgensen, J., Leuschel, M., Martens, B., S\u00f8rensen, M.H.: Conjunctive partial deduction: foundations, control, algorithms and experiments. The Journal of Logic Programming\u00a041, 231\u2013277 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/1993287","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-ordering, the Tree Theorem, and Varsonyi\u2019s conjecture. Trans.Amer. Math. Society\u00a095, 210\u2013225 (1960)","journal-title":"Trans.Amer. Math. Society"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-48958-4_11","volume-title":"LOPSTR 1998","author":"M. Leuschel","year":"1999","unstructured":"Leuschel, M.: Improving Homeomorphic Embeddings for On line Termination. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol.\u00a01559, pp. 199\u2013218. Springer, Heidelberg (1999)"},{"key":"29_CR6","unstructured":"Leuschel, M.: Ecce partial deduction system, \n                    \n                      http:\/\/www.ecs.soton.ac.uk\/~mal\/systems\/ecce.html"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C. Nash-Williams","year":"1963","unstructured":"Nash-Williams, C.: On well quasi ordering finite trees. Proc. Camb. Phil. Society\u00a059, 833\u2013835 (1963)","journal-title":"Proc. Camb. Phil. Society"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science\u00a0142, 89\u2013124 (1995)","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","unstructured":"Tamaki, H., Sato, T.: Unfold\/Fold Transformation of Logic Programs. In: T\u00e4rnlund, S. (ed.) ICLP 1984, pp. 127\u2013138, Uppsala University, Sweeden (1984)"},{"issue":"3","key":"29_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1017\/S0956796800000757","volume":"3","author":"V.F. Turchin","year":"1993","unstructured":"Turchin, V.F.: Program transformation with metasystems transitions. Journal of Functional Programming\u00a03(3), 283\u2013313 (1993)","journal-title":"Journal of Functional Programming"},{"key":"29_CR11","unstructured":"Vysko\u010dil, J., \u0160t\u011bp\u00e1nek, P., Halama, M.: Speedup by Fully Automated Unfold\/Fold Transformation. Technical Report TR No 2006 \/1 Department of KTIML MFF, Charles University in Prague (2006)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2007: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76631-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:53Z","timestamp":1619520953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76631-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766308"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76631-5_29","relation":{},"subject":[]}}