{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:34:36Z","timestamp":1725496476956},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668565"},{"type":"electronic","value":"9783540466741"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46674-6_27","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T15:50:17Z","timestamp":1196351417000},"page":"322-333","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Beyond Tamaki-Sato Style Unfold\/Fold Transformations for Normal Logic Programs"],"prefix":"10.1007","author":[{"given":"Abhik","family":"Roychoudhury","sequence":"first","affiliation":[]},{"given":"C. R.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"C. Aravindan and P.M. Dung. On the correctness of unfold\/fold transformations of normal and extended logic programs. Journal of Logic Programming, pages 295\u2013322, 1995.","DOI":"10.1016\/0743-1066(94)00104-E"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"A. Bossi, N. Cocco, and S. Dulli. A method of specializing logic programs. ACM TOPLAS, pages 253\u2013302, 1990.","DOI":"10.1145\/78942.78947"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/logcom\/6.1.79","volume":"6","author":"A. Bossi","year":"1996","unstructured":"A. Bossi, N. Cocco, and S. Etalle. Simultaneous replacement in normal programs. Journal of Logic and Computation, 6(1):79\u2013120, February 1996.","journal-title":"Journal of Logic and Computation"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"D. Boulanger and M. Bruynooghe. Deriving unfold\/fold transformations of logic programs using extended OLDT-based abstract interpretation. Journal of Symbolic Computation, pages 495\u2013521, 1993.","DOI":"10.1016\/S0747-7171(06)80003-9"},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of PLILP\/ALP","author":"B. Cui","year":"1998","unstructured":"B. Cui, Y. Dong, X. Du, K. Narayan Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan, A. Roychoudhury, S.A. Smolka, and D.S. Warren. Logic programming and model checking. In Proceedings of PLILP\/ALP, LNCS 1490, pages 1\u201320, 1998."},{"key":"27_CR6","first-page":"604","volume":"1","author":"P.M. Dung","year":"1989","unstructured":"P.M. Dung and K. Kanchanasut. A fixpoint approach to declarative semantics of logic programs. Proceedings of North American Conference on Logic Programming, 1:604\u2013625, 1989.","journal-title":"Proceedings of North American Conference on Logic Programming"},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-58402-1_24","volume-title":"Proceedings of PLILP","author":"M. Gergatsoulis","year":"1994","unstructured":"M. Gergatsoulis and M. Katzouraki. Unfold\/fold transformations for definite clause programs. In Proceedings of PLILP, LNCS 844, pages 340\u2013354, 1994."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"T. Kanamori and H. Fujita. Formulation of Induction Formulas in Verification of Prolog Programs. Proceedings of International Conference on Automated Deduction (CADE), pages 281\u2013299, 1986.","DOI":"10.1007\/3-540-16780-3_97"},{"key":"27_CR9","unstructured":"T. Kanamori and H. Fujita. Unfold\/fold transformation of logic programs with counters. In USA-Japan Seminar on Logics of Programs, 1987."},{"key":"27_CR10","unstructured":"M. Leuschel, D. De Schreye, and A. De Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In Joint International Conference and Symposium on Logic Programming, pages 319\u2013332, 1996."},{"key":"27_CR11","unstructured":"J.W. Lloyd. Foundations of Logic Programming, 2nd Ed. Springer-Verlag, 1993."},{"key":"27_CR12","unstructured":"M. J. Maher. Correctness of a logic program transformation system. Technical report, IBM T.J. Watson Research Center, 1987."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","volume":"110","author":"M. J. Maher","year":"1993","unstructured":"M. J. Maher. A transformation system for deductive database modules with perfect model semantics. Theoretical Computer Science, 110:377\u2013403, 1993.","journal-title":"Theoretical Computer Science"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"A. Pettorossi and M. Proietti. Transformation of logic programs, volume 5 of Handbook of Logic in Artificial Intelligence, pages 697\u2013787. Oxford University Press, 1998.","DOI":"10.1093\/oso\/9780198537922.003.0013"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"A. Pettorossi, M. Proietti, and S. Renault. Reducing nondeterminism while spetializing logic programs. In Proceedings of POPL, pages 414\u2013427, 1997.","DOI":"10.1145\/263699.263759"},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/10704567_24","volume-title":"Principles and Practice of Declarative Programming (PPDP)","author":"A. Roychoudhury","year":"1999","unstructured":"A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, and I.V. Ramakrishnan. A parameterized unfold\/fold transformation framework for definite logic Programs. In Principles and Practice of Declarative Programming (PPDP), LNCS 1702, pages 396\u2013413, 1999."},{"key":"27_CR17","unstructured":"A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, and I.V. Ramakrishnan. Proofs by program transformations. To appear in proceedings of Logic-based Program Synthesis and Transformation (LOPSTR), 1999."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"H. Seki. Unfold\/fold transformation of stratified programs. In Theoretical Computer Science, pages 107\u2013139, 1991.","DOI":"10.1016\/0304-3975(91)90007-O"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"H. Seki. Unfold\/fold transformation of general logic programs for well-founded semantics. In Journal of Logic Programming. pages 5\u201323, 1993.","DOI":"10.1016\/0743-1066(93)90021-8"},{"key":"27_CR20","unstructured":"H. Tamaki and T. Sato. Unfold\/fold transformations of logic programs. In Proceedings of International Conference on Logic Programming, pages 127\u2013138, 1984."},{"key":"27_CR21","unstructured":"H. Tamaki and T. Sato. A generalized correctness proof of the unfold\/ fold logic program transformation. Technical report, Ibaraki University, Japan, 1986."}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN\u201999"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46674-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,29]],"date-time":"2021-08-29T11:07:57Z","timestamp":1630235277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46674-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668565","9783540466741"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46674-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 November 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}