{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:07:35Z","timestamp":1794341255988,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_15","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"179-195","source":"Crossref","is-referenced-by-count":2,"title":["Proving Properties of Constraint Logic Programs by Eliminating Existential Variables"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pettorossi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerio","family":"Senni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"issue":"20","key":"15_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19","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":"15_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/B978-044450813-3\/50015-1","volume-title":"Handbook of Automated Reasoning","author":"A. Bundy","year":"2001","unstructured":"Bundy, A.: The automation of proof by mathematical induction. In: Handbook of Automated Reasoning, vol.\u00a0I, pp. 845\u2013911. North-Holland, Amsterdam (2001)"},{"issue":"1","key":"15_CR4","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"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","volume":"42","author":"B. Courcelle","year":"1986","unstructured":"Courcelle, B.: Equivalences and transformations of regular systems \u2013 applications to recursive program schemes and grammars. Theor. Comp. Sci.\u00a042, 1\u2013122 (1986)","journal-title":"Theor. Comp. Sci."},{"key":"15_CR6","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":"15_CR7","first-page":"85","volume-title":"Proceedings VCL 2001","author":"F. Fioravanti","year":"2001","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Verifying CTL properties of infinite state systems by specializing constraint logic programs. In: Proceedings VCL 2001, Florence, Italy, pp. 85\u201396. University of Southampton, UK (2001)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-25951-0_10","volume-title":"Program Development in Computational Logic","author":"F. Fioravanti","year":"2004","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Transformation Rules for Locally Stratified Constraint Logic Programs. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 291\u2013339. Springer, Heidelberg (2004)"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02576192","volume":"19","author":"L. Kott","year":"1982","unstructured":"Kott, L.: The McCarthy\u2019s induction principle: \u2018oldy\u2019 but \u2018goody\u2019. Calcolo\u00a019(1), 59\u201369 (1982)","journal-title":"Calcolo"},{"key":"15_CR10","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":"15_CR11","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, Heidelberg (1987)","edition":"2"},{"key":"15_CR12","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":"15_CR13","unstructured":"The MAP System, \n                    \n                      http:\/\/www.iasi.cnr.it\/~proietti\/system.html"},{"issue":"2&3","key":"15_CR14","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":"15_CR15","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)"},{"issue":"1","key":"15_CR16","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. Theor.Comp.Sci.\u00a0142(1), 89\u2013124 (1995)","journal-title":"Theor.Comp.Sci."},{"key":"15_CR17","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":"15_CR18","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0049-237X(08)71116-9","volume-title":"Handbook of Mathematical Logic","author":"M.O. Rabin","year":"1977","unstructured":"Rabin, M.O.: Decidable theories. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 595\u2013629. North-Holland, Amsterdam (1977)"},{"key":"15_CR19","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":"A. Roychoudhury","year":"2000","unstructured":"Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A.: Verification of Parameterized Systems Using Logic Program Transformations. In: Schwartzbach, M.I., Graf, S. (eds.) ETAPS 2000 and TACAS 2000. LNCS, vol.\u00a01785, pp. 172\u2013187. Springer, Heidelberg (2000)"},{"key":"15_CR20","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: T\u00e4rnlund, S.-\u00c5. (eds.) Proceedings of ICLP 1984, pp. 127\u2013138, Uppsala, Sweden (1984)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:24:45Z","timestamp":1619493885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11799573_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11799573","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}