{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:54:37Z","timestamp":1725544477731},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540326540"},{"type":"electronic","value":"9783540326564"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11680093_6","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T01:43:40Z","timestamp":1141091020000},"page":"80-97","source":"Crossref","is-referenced-by-count":1,"title":["Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs"],"prefix":"10.1007","author":[{"given":"Claudio","family":"Ochoa","sequence":"first","affiliation":[]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Gallagher, J.: A system for specialising logic programs. Technical Report TR-91-32, University of Bristol (November 1991)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J. Gallagher","year":"1991","unstructured":"Gallagher, J., Bruynooghe, M.: The derivation of an algorithm for program specialisation. New Generation Computing\u00a09, 305\u2013333 (1991)","journal-title":"New Generation Computing"},{"key":"6_CR3","first-page":"88","volume-title":"Proc. of PEPM 1993","author":"J.P. Gallagher","year":"1993","unstructured":"Gallagher, J.P.: Tutorial on specialisation of logic programs. In: Proc. of PEPM 1993, pp. 88\u201398. ACM Press, New York (1993)"},{"key":"6_CR4","first-page":"52","volume-title":"1999 ICLP","author":"M. Hermenegildo","year":"1999","unstructured":"Hermenegildo, M., Bueno, F., Puebla, G., L\u00f3pez-Garc\u00eda, P.: Program Analysis, Debugging and Optimization Using the Ciao System Preprocessor. In: 1999 ICLP, pp. 52\u201366. MIT Press, Cambridge (1999)"},{"key":"6_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60939-3_1","volume-title":"Logic Program Synthesis and Transformation","author":"M. Leuschel","year":"1996","unstructured":"Leuschel, M.: Ecological partial deduction: Preserving characteristic trees without constraints. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 1\u201316. Springer, Heidelberg (1996)"},{"issue":"4, 5","key":"6_CR7","first-page":"461","volume":"2","author":"M. Leuschel","year":"2002","unstructured":"Leuschel, M., Bruynooghe, M.: Logic program specialisation through partial deduction: Control issues. TPLP\u00a02(4, 5), 461\u2013515 (2002)","journal-title":"TPLP"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-61580-6_13","volume-title":"Partial Evaluation","author":"M. Leuschel","year":"1996","unstructured":"Leuschel, M., Martens, B.: Global control for partial deduction through characteristic atoms and global trees. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01110, pp. 263\u2013283. Springer, Heidelberg (1996)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/271510.271525","volume":"20","author":"M. Leuschel","year":"1998","unstructured":"Leuschel, M., Martens, B., De Schreye, D.: Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM TOPLAS\u00a020(1), 208\u2013258 (1998)","journal-title":"ACM TOPLAS"},{"key":"6_CR10","unstructured":"Leuschel, M.: The ECCE partial deduction system and the DPPD library of benchmarks (1996-2002), \n                    \n                      http:\/\/www.ecs.soton.ac.uk\/~mal"},{"key":"6_CR11","unstructured":"Leuschel, M.: Advanced Techniques for Logic Program Specialisation. PhD thesis, K.U.Leuven (May 1997)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF03037483","volume":"16","author":"M. Leuschel","year":"1998","unstructured":"Leuschel, M., Schreye, D.D.: Constrained partial deduction and the preservation of characteristic trees. New Generation Computing\u00a016, 283\u2013342 (1998)","journal-title":"New Generation Computing"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J.W. Lloyd","year":"1991","unstructured":"Lloyd, J.W., Shepherdson, J.C.: Partial evaluation in logic programming. The Journal of Logic Programming\u00a011, 217\u2013242 (1991)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR14","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 Ext. edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/11506676_10","volume-title":"Logic Based Program Synthesis and Transformation","author":"G. Puebla","year":"2005","unstructured":"Puebla, G., Albert, E., Hermenegildo, M.: Efficient Local Unfolding with Ancestor Stacks for Full Prolog. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol.\u00a03573, pp. 149\u2013165. Springer, Heidelberg (2005)"},{"key":"6_CR16","first-page":"77","volume-title":"Proc. of PEPM 1995","author":"G. Puebla","year":"1995","unstructured":"Puebla, G., Hermenegildo, M.: Implementation of Multiple Specialization in Logic Programs. In: Proc. of PEPM 1995, June 1995, pp. 77\u201387. ACM Press, New York (1995)"},{"issue":"2, 3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0743-1066(99)00031-X","volume":"41","author":"G. Puebla","year":"1999","unstructured":"Puebla, G., Hermenegildo, M.: Abstract Multiple Specialization and its Application to Program Parallelization. JLP\u00a041(2, 3), 279\u2013316 (1999)","journal-title":"JLP"},{"issue":"2, 3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0743-1066(92)90033-Y","volume":"13","author":"W. Winsborough","year":"1992","unstructured":"Winsborough, W.: Multiple Specialization using Minimal-Function Graph Semantics. Journal of Logic Programming\u00a013(2, 3), 259\u2013290 (1992)","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11680093_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T02:05:39Z","timestamp":1552356339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11680093_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540326540","9783540326564"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11680093_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}