{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:14:12Z","timestamp":1648584852179},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540609391","type":"print"},{"value":"9783540497455","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60939-3_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:06:37Z","timestamp":1330290397000},"page":"1-16","source":"Crossref","is-referenced-by-count":5,"title":["Ecological partial deduction: Preserving characteristic trees without constraints"],"prefix":"10.1007","author":[{"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"5","key":"1_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1093\/logcom\/3.5.469","volume":"3","author":"K. Benkerimi","year":"1993","unstructured":"K. Benkerimi and P. M. Hill. Supporting transformations for the partial evaluation of logic programs. Journal of Logic and Computation, 3(5):469\u2013486, October 1993.","journal-title":"Journal of Logic and Computation"},{"key":"1_CR2","unstructured":"K. Benkerimi and J. W. Lloyd. A partial evaluation procedure for logic programs. In S. Debray and M. Hermenegildo, editors, Proceedings of the North American Conference on Logic Programming, pages 343\u2013358. MIT Press, 1990."},{"issue":"1","key":"1_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47\u201379, 1992.","journal-title":"New Generation Computing"},{"key":"1_CR4","unstructured":"J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Tutorial on specialisation of logic programs. In Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88\u201398. ACM Press, 1993.","DOI":"10.1145\/154630.154640"},{"key":"1_CR6","unstructured":"J. Gallagher and M. Bruynooghe. Some low-level transformations for logic programs. In M. Bruynooghe, editor, Proceedings of Meta90 Workshop on Meta Programming in Logic, pages 229\u2013244, Leuven, Belgium, 1990."},{"issue":"3","key":"1_CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J. Gallagher","year":"1991","unstructured":"J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305\u2013333, 1991.","journal-title":"New Generation Computing"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"J. Komorowski. An introduction to partial deduction. In A. Pettorossi, editor, Proceedings Meta'92, pages 49\u201369. Springer-Verlag, LNCS 649, 1992.","DOI":"10.1007\/3-540-56282-6_4"},{"key":"1_CR9","volume-title":"Technical report, Department of Computational Science","author":"J. Lam","year":"1990","unstructured":"J. Lam and A. Kusalik. A comparative analysis of partial deductors for pure Prolog. Technical report, Department of Computational Science, University of Saskatchewan, Canada, May 1990. Revised April 1991."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"J.-L. Lassez, M. Maher, and K. Marriott. Unification revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587\u2013625. Morgan-Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science 883","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-58792-6_8","volume-title":"Logic Program Synthesis and Transformation \u2014 Meta-Programming in Logic","author":"M. Leuschel","year":"1994","unstructured":"M. Leuschel. Partial evaluation of the \u201creal thing\u201d. In L. Fribourg and F. Turini, editors, Logic Program Synthesis and Transformation \u2014 Meta-Programming in Logic. Proceedings of LOPSTR'94 and META '94, Lecture Notes in Computer Science 883, pages 122\u2013137, Pisa, Italy, June 1994. Springer-Verlag."},{"key":"1_CR12","volume-title":"Technical Report CW 199","author":"M. Leuschel","year":"1994","unstructured":"M. Leuschel and D. De Schreye. An almost perfect abstraction operator for partial deduction. Technical Report CW 199, Departement Computerwetenschappen, K.U. Leuven, Belgium, December 1994."},{"key":"1_CR13","volume-title":"Technical Report CW 215","author":"M. Leuschel","year":"1995","unstructured":"M. Leuschel and D. De Schreye. An almost perfect abstraction operation for partial deduction using characteristic trees. Technical Report CW 215, Departement Computerwetenschappen, K.U. Leuven, Belgium, October 1995. Submitted for Publication. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"1_CR14","volume-title":"Technical Report CW 220","author":"M. Leuschel","year":"1995","unstructured":"M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. Technical Report CW 220, Departement Computerwetenschappen, K.U. Leuven, Belgium, December 1995. Submitted for Publication. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"1_CR15","first-page":"495","volume-title":"Partial deduction of the ground representation and its application to integrity checking","author":"M. Leuschel","year":"1995","unstructured":"M. Leuschel and B. Martens. Partial deduction of the ground representation and its application to integrity checking. In J. Lloyd, editor, Proceedings of ILPS'95, the International Logic Programming Symposium, pages 495\u2013509, Portland, USA, December 1995. MIT Press. Extended version as Technical Report CW 210, K.U. Leuven. Accessible via http:\/\/www.cs.kuleuven.ac.be\/lpai."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11:217\u2013242, 1991.","journal-title":"The Journal of Logic Programming"},{"key":"1_CR18","unstructured":"B. Martens. On the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming. PhD thesis, K.U. Leuven, February 1994."},{"issue":"1\u20132","key":"1_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(94)90203-8","volume":"122","author":"B. Martens","year":"1994","unstructured":"B. Martens, D. De Schreye, and T. Horv\u00e1th. Sound and complete partial deduction with unfolding based on well-founded measures. Theoretical Computer Science, 122(1\u20132):97\u2013117, 1994.","journal-title":"Theoretical Computer Science"},{"key":"1_CR20","first-page":"597","volume-title":"Proceedings ICLP'95","author":"B. Martens","year":"1995","unstructured":"B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP'95, pages 597\u2013613, Kanagawa, Japan, June 1995. MIT Press. Extended version as Technical Report CSTR-94-16, University of Bristol."},{"key":"1_CR21","unstructured":"D. Meulemans. Parti\u00eble deductie: Een substanti\u00eble vergelijkende studie. Master's thesis, K.U. Leuven, 1995."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19 & 20:261\u2013320, May 1994.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"1_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0743-1066(93)90025-C","volume":"16","author":"M. Proietti","year":"1993","unstructured":"M. Proietti and A. Pettorossi. The loop absorption and the generalization strategies for the development of logic programs and partial deduction. The Journal of Logic Programming, 16(1 & 2):123\u2013162, May 1993.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"1_CR24","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","volume":"12","author":"D. Sahlin","year":"1993","unstructured":"D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1):7\u201351, 1993.","journal-title":"New Generation Computing"}],"container-title":["Logic Program Synthesis and Transformation","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60939-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:56Z","timestamp":1605646976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60939-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609391","9783540497455"],"references-count":24,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-60939-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1996]]}}}