{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:53:59Z","timestamp":1742950439511,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_10","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"291-339","source":"Crossref","is-referenced-by-count":16,"title":["Transformation Rules for Locally Stratified Constraint Logic Programs"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Fioravanti","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Pettorossi","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-55844-6_153","volume-title":"Programming Language Implementation and Logic Programming","author":"M. Alpuente","year":"1992","unstructured":"Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: A transformation system for lazy functional logic programs. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, pp. 147\u2013162. Springer, Heidelberg (1992)"},{"key":"10_CR2","first-page":"493","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Introduction to logic programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 493\u2013576. Elsevier, Amsterdam (1990)"},{"key":"10_CR3","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice Hall, London (1997)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19-20","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. Journal of Logic Programming\u00a019-20, 9\u201371 (1994)","journal-title":"Journal of Logic Programming"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J.-M. Autebert","year":"1997","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 111\u2013174. Springer, Berlin (1997)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-25951-0_2","volume-title":"Program Development in Computational Logic","author":"D. Basin","year":"2004","unstructured":"Basin, D., Deville, Y., Flener, P., Hamfelt, A., Nilsson, J.F.: Synthesis of programs in computational logic. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 30\u201365. Springer, Heidelberg (2004)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(97)00077-7","volume":"206","author":"N. Bensaou","year":"1998","unstructured":"Bensaou, N., Guessarian, I.: Transforming constraint logic programs. Theoretical Computer Science\u00a0206, 81\u2013125 (1998)","journal-title":"Theoretical Computer Science"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-56282-6_18","volume-title":"Meta-Programming in Logic","author":"A. Bossi","year":"1992","unstructured":"Bossi, A., Cocco, N., Etalle, S.: Transforming normal programs by replacement. In: Pettorossi, A. (ed.) META 1992. LNCS, vol.\u00a0649, pp. 265\u2013279. Springer, Heidelberg (1992)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal of the ACM\u00a024(1), 44\u201367 (1977)","journal-title":"Journal of the ACM"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/232706.232734","volume":"18","author":"M. Garcia de la Banda","year":"1996","unstructured":"Garcia de la Banda, M., Hermenegildo, M., Bruynooghe, M., Dumortier, V., Janssens, G., Simoens, W.: Global analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems\u00a018(5), 564\u2013614 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR11","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, 101\u2013146 (1996)","journal-title":"Theoretical Computer Science"},{"key":"10_CR12","unstructured":"Fioravanti, F.: Transformation of Constraint Logic Programs for Software Specialization and Verification. PhD thesis, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Italy (2002)"},{"key":"10_CR13","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Verifying CTL properties of infinite state systems by specializing constraint logic programs. In: Proceedings of the ACM Sigplan Workshop on Verification and Computational Logic VCL 2001, Florence (Italy), Technical Report DSSE-TR-2001-3, pp. 85\u201396. University of Southampton, UK (2001)"},{"key":"10_CR14","volume-title":"Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Hammamet (Tunisia)","author":"F. Fioravanti","year":"2002","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Specialization with clause splitting for deriving deterministic constraint logic programs. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Hammamet (Tunisia), IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","first-page":"96","volume-title":"CONCUR\u201997: Concurrency Theory","author":"L. Fribourg","year":"1997","unstructured":"Fribourg, L., Ols\u00e9n, H.: Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 96\u2013107. Springer, Heidelberg (1997)"},{"key":"10_CR16","first-page":"565","volume-title":"Computational Logic, Essays in Honor of Alan Robinson","author":"P.A. Gardner","year":"1991","unstructured":"Gardner, P.A., Shepherdson, J.C.: Unfold\/fold transformations of logic programs. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, pp. 565\u2013583. MIT, Cambridge (1991)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-58402-1_24","volume-title":"Programming Language Implementation and Logic Programming","author":"M. Gergatsoulis","year":"1994","unstructured":"Gergatsoulis, M., Katzouraki, M.: Unfold\/fold transformations for definite clause programs. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 340\u2013354. Springer, Heidelberg (1994)"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/322248.322258","volume":"28","author":"C.J. Hogger","year":"1981","unstructured":"Hogger, C.J.: Derivation of logic programs. Journal of the ACM\u00a028(2), 372\u2013392 (1981)","journal-title":"Journal of the ACM"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19-20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.: Constraint logic programming: A survey. Journal of Logic Programming\u00a019-20, 503\u2013581 (1994)","journal-title":"Journal of Logic Programming"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M., Marriott, K., Stuckey, P.: The semantics of constraint logic programming. Journal of Logic Programming\u00a037, 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"key":"10_CR21","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"10_CR22","unstructured":"Kanamori, T., Fujita, H.: Unfold\/fold transformation of logic programs with counters. Technical Report 179, ICOT, Tokyo, Japan (1986)"},{"key":"10_CR23","first-page":"744","volume-title":"Proceedings of the Fourth International Conference on Logic Programming","author":"T. Kanamori","year":"1987","unstructured":"Kanamori, T., Horiuchi, K.: Construction of logic programs based on generalized unfold\/fold rules. In: Proceedings of the Fourth International Conference on Logic Programming, pp. 744\u2013768. The MIT Press, Cambridge (1987)"},{"issue":"4&5","key":"10_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S147106840200145X","volume":"2","author":"M. Leuschel","year":"2002","unstructured":"Leuschel, M., Bruynooghe, M.: Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming\u00a02(4&5), 461\u2013515 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/10720327_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M. Leuschel","year":"2000","unstructured":"Leuschel, M., Massart, T.: Infinite state model checking by abstract interpretation and program specialization. In: Bossi, A. (ed.) LOPSTR 1999. LNCS, vol.\u00a01817, pp. 63\u201382. Springer, Heidelberg (2000)"},{"key":"10_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)","edition":"2"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","volume":"110","author":"M.J. Maher","year":"1993","unstructured":"Maher, M.J.: A transformation system for deductive database modules with perfect model semantics. Theoretical Computer Science\u00a0110, 377\u2013403 (1993)","journal-title":"Theoretical Computer Science"},{"key":"10_CR28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"20","author":"A. Pettorossi","year":"1994","unstructured":"Pettorossi, A., Proietti, M.: Transformation of logic programs: Foundations and techniques. Journal of Logic Programming\u00a020, 261\u2013320 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"2&3","key":"10_CR30","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0743-1066(99)00029-1","volume":"41","author":"A. Pettorossi","year":"1999","unstructured":"Pettorossi, A., Proietti, M.: Synthesis and transformation of logic programs using unfold\/fold proofs. Journal of Logic Programming\u00a041(2&3), 197\u2013230 (1999)","journal-title":"Journal of Logic Programming"},{"key":"10_CR31","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-44957-4_41","volume-title":"Computational Logic - CL 2000","author":"A. Pettorossi","year":"2000","unstructured":"Pettorossi, A., Proietti, M.: Perfect model checking via unfold\/fold transformations. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 613\u2013628. Springer, Heidelberg (2000)"},{"key":"10_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-45628-7_12","volume-title":"Computational Logic: Logic Programming and Beyond","author":"A. Pettorossi","year":"2002","unstructured":"Pettorossi, A., Proietti, M.: Program Derivation = Rules + Strategies. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02407, pp. 273\u2013309. Springer, Heidelberg (2002)"},{"key":"10_CR33","first-page":"414","volume-title":"Proc. 24th ACM Symposium on Principles of Programming Languages, Paris, France","author":"A. Pettorossi","year":"1997","unstructured":"Pettorossi, A., Proietti, M., Renault, S.: Reducing nondeterminism while specializing logic programs. In: Proc. 24th ACM Symposium on Principles of Programming Languages, Paris, France, pp. 414\u2013427. ACM Press, New York (1997)"},{"issue":"1","key":"10_CR34","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(1), 89\u2013124 (1995)","journal-title":"Theoretical Computer Science"},{"key":"10_CR35","first-page":"193","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T.C. Przymusinski","year":"1987","unstructured":"Przymusinski, T.C.: On the declarative semantics of stratified deductive databases and logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193\u2013216. Morgan Kaufmann, San Francisco (1987)"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-46419-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Roychoudhury","year":"2000","unstructured":"Roychoudhury, K., Narayan Kumar, C.R., Ramakrishnan, I.V.: Verification of parameterized systems using logic program transformations. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 172\u2013187. Springer, Heidelberg (2000)"},{"issue":"3","key":"10_CR37","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054102001175","volume":"13","author":"A. Roychoudhury","year":"2002","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond Tamaki-Sato style unfold\/fold transformations for normal logic programs. International Journal on Foundations of Computer Science\u00a013(3), 387\u2013403 (2002)","journal-title":"International Journal on Foundations of Computer Science"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/10704567_24","volume-title":"Principles and Practice of Declarative Programming","author":"A. Roychoudhury","year":"1999","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: A parameterized unfold\/fold transformation framework for definite logic programs. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 396\u2013413. Springer, Heidelberg (1999)"},{"issue":"2","key":"10_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/227699.227716","volume":"18","author":"D. Sands","year":"1996","unstructured":"Sands, D.: Total correctness by local improvement in the transformation of functional programs. ACM Toplas\u00a018(2), 175\u2013234 (1996)","journal-title":"ACM Toplas"},{"key":"10_CR40","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(92)90287-P","volume":"105","author":"T. Sato","year":"1992","unstructured":"Sato, T.: An equivalence preserving first order unfold\/fold transformation system. Theoretical Computer Science\u00a0105, 57\u201384 (1992)","journal-title":"Theoretical Computer Science"},{"key":"10_CR41","unstructured":"Sato, T., Tamaki, H.: Transformational logic program synthesis. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 195\u2013201. ICOT (1984)"},{"key":"10_CR42","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, 107\u2013139 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"10_CR43","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 well-founded semantics. Journal of Logic Programming\u00a016(1&2), 5\u201323 (1993)","journal-title":"Journal of Logic Programming"},{"key":"10_CR44","first-page":"127","volume-title":"Proceedings of the Second International Conference on Logic Programming","author":"H. Tamaki","year":"1984","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: T\u00e4rnlund, S.-\u00c5. (ed.) Proceedings of the Second International Conference on Logic Programming, pp. 127\u2013138. Uppsala University, Uppsala (1984)"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T14:09:08Z","timestamp":1675087748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}