{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:06Z","timestamp":1725522246060},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_29","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"284-300","source":"Crossref","is-referenced-by-count":0,"title":["A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs"],"prefix":"10.1007","author":[{"given":"Valerio","family":"Senni","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Pettorossi","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","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"},{"issue":"1","key":"29_CR2","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. Theo. Comp. Sci.\u00a0142(1), 89\u2013124 (1995)","journal-title":"Theo. Comp. Sci."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11799573_15","volume-title":"Logic Programming","author":"A. Pettorossi","year":"2006","unstructured":"Pettorossi, A., Proietti, M., Senni, V.: Proving properties of constraint logic programs by eliminating existential variables. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 179\u2013195. Springer, Heidelberg (2006)"},{"issue":"1","key":"29_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":"29_CR5","first-page":"127","volume-title":"Proc. ICLP 1984","author":"H. Tamaki","year":"1984","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: T\u00e4rnlund, S.\u00c5. (ed.) Proc. ICLP 1984, pp. 127\u2013138. Uppsala University, Uppsala (1984)"},{"key":"29_CR6","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":"29_CR7","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":"29_CR8","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":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","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: Lau, K.K., Bruynooghe, M. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 292\u2013340. Springer, Heidelberg (2004)"},{"key":"29_CR10","doi-asserted-by":"publisher","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":"29_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1986)"},{"issue":"1-2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0747-7171(88)80003-8","volume":"5","author":"V. Weispfenning","year":"1988","unstructured":"Weispfenning, V.: The complexity of linear problems in fields. J. Symb. Comput.\u00a05(1-2), 3\u201327 (1988)","journal-title":"J. Symb. Comput."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","volume-title":"Handbook of Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, pp. 445\u2013532. Elsevier Science, Amsterdam (2001)"},{"key":"29_CR14","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press (2003)"},{"key":"29_CR15","unstructured":"Senni, V.: Transformation Techniques for Constraint Logic Programs with Application to Protocol Verification. PhD thesis, University of Rome \u201cTor Vergata\u201d, Rome, Italy (2008)"},{"issue":"1-2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D. Benanav","year":"1987","unstructured":"Benanav, D., Kapur, D., Narendran, P.: Complexity of matching problems. Journal of Symbolic Computation\u00a03(1-2), 203\u2013216 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR17","unstructured":"Livesey, M., Siekmann, J.: Unification of A+C Terms (Bags) and A+C+I Terms (Sets). TR 3\/76, Institut f\u00fcr Informatik I, Universit\u00e4t Karlsruhe (1976)"},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/322261.322262","volume":"28","author":"M.E. Stickel","year":"1981","unstructured":"Stickel, M.E.: A unification algorithm for associative-commutative functions. J. ACM\u00a028(3), 423\u2013434 (1981)","journal-title":"J. ACM"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-16780-3_116","volume-title":"8th International Conference on Automated Deduction","author":"H.J. B\u00fcrckert","year":"1986","unstructured":"B\u00fcrckert, H.J.: Some relationships between unification, restricted unification, and matching. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 514\u2013524. Springer, Heidelberg (1986)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-45085-6_17","volume-title":"Automated Deduction \u2013 CADE-19","author":"C. Ringeissen","year":"2003","unstructured":"Ringeissen, C.: Matching in a class of combined non-disjoint theories. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 212\u2013227. Springer, Heidelberg (2003)"},{"key":"29_CR21","unstructured":"The MAP transformation system, \n                      \n                        http:\/\/www.iasi.cnr.it\/~proietti\/system.html"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T11:28:34Z","timestamp":1551698914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}