{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:22Z","timestamp":1761610522485,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80634-6","type":"journal-article","created":{"date-parts":[[2005,4,24]],"date-time":"2005-04-24T07:16:06Z","timestamp":1114326966000},"page":"129-144","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Rules and Strategies for Contextual Specialization of Constraint Logic Programs"],"prefix":"10.1016","volume":"30","author":[{"given":"Fabio","family":"Fioravanti","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Pettorossi","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"206","key":"10.1016\/S1571-0661(05)80634-6_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0304-3975(97)00077-7","article-title":"Transforming constraint logic programs","author":"Bensaou","year":"1998","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S1571-0661(05)80634-6_BIB2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/78942.78947","article-title":"A method for specializing logic programs","volume":"12","author":"Bossi","year":"1990","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"10.1016\/S1571-0661(05)80634-6_BIB3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/169683.174155","article-title":"Parameterized partial evaluation","volume":"15","author":"Consel","year":"1993","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0304-3975(95)00148-4","article-title":"Transformations of CLP modules","volume":"166","author":"Etalle","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB5","series-title":"In Proceedings of ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM \u203293, Copenhagen, Denmark","first-page":"88","article-title":"Tutorial on specialization of logic programs","author":"Gallagher","year":"1993"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB6","series-title":"In Proceedings ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM \u203291, New Haven, CT, USA, SIGPLAN Notices, 26, 9","first-page":"43","article-title":"Towards the partial evaluation of CLP languages","author":"Hickey","year":"1991"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: A survey","volume":"19\/20","author":"Jaffar","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","article-title":"The semantics of constraint logic programming","volume":"37","author":"Jaffar","year":"1998","journal-title":"Journal of Logic Programming"},{"year":"1993","series-title":"Partial Evaluation and Automatic Program Generation","author":"Jones","key":"10.1016\/S1571-0661(05)80634-6_BIB9"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB10","unstructured":"M. Leuschel and D. De Schreye. Constrained partial deduction. In B. Freitag F. Bry and D. Seipel, editors, Proceedings of the 12th Workshop Logische Programmierung (WLP\u203297), pages 116-126, Munich, Germany, September 1997."},{"key":"10.1016\/S1571-0661(05)80634-6_BIB11","doi-asserted-by":"crossref","unstructured":"M. Leuschel and M. H. S\u00f8rensen. Redundant argument filtering of logic programs. In J. Gallagher, editor, Logic Program Synthesis and Transformation, Proceedings LoPSTr \u203296, Stockholm, Sweden, Lecture Notes in Computer Science 1207, pages 83-103. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62718-9_6"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","article-title":"Partial evaluation in logic programming","volume":"11","author":"Lloyd","year":"1991","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","article-title":"A transformation system for deductive database modules with perfect model semantics","volume":"110","author":"Maher","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB14","doi-asserted-by":"crossref","unstructured":"Kim Marriott and Peter J. Stuckey. The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering. In Proceedings 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u203293), pages 334-344. ACM Press, 1993.","DOI":"10.1145\/158511.158685"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB15","series-title":"Proceedings of the Dagstuhl Seminar on Partial Evaluation, Lecture Notes in Computer Science 1110","first-page":"386","article-title":"A theory of logic program specialization and generalization for dealing with input data properties","author":"Pettorossi","year":"1996"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0743-1066(99)00029-1","article-title":"Synthesis and transformation of logic programs using unfold\/fold proofs","volume":"41","author":"Pettorossi","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB17","series-title":"In Proc. 24-th ACM Symposium on Principles of Programming Languages, Paris, France","first-page":"414","article-title":"Reducing nondeterminism while specializing logic programs","author":"Pettorossi","year":"1997"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB18","series-title":"In Proceedings ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM \u203293, Copenhagen, Denmark","first-page":"111","article-title":"Online partial deduction of large programs","author":"Prestwich","year":"1993"},{"issue":"2&3","key":"10.1016\/S1571-0661(05)80634-6_BIB19","first-page":"279","article-title":"Abstract Multiple Specialization and its Application to Program Parallelization","volume":"41","author":"Puebla","year":"1999","journal-title":"J. of Logic Programming. Special Issue on Synthesis, Transformation and Analysis of Logic Programs"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB20","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03038271","article-title":"Mixtus: An automatic partial evaluator for full Prolog","volume":"12","author":"Sahlin","year":"1993","journal-title":"New Generation Computing"},{"key":"10.1016\/S1571-0661(05)80634-6_BIB21","series-title":"Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Lecture Notes in Computer Science 1079","first-page":"98","article-title":"Partial evaluation in constraint logic programming","author":"Wrzos-Kaminska","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806346?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806346?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:51Z","timestamp":1761610131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000]]}},"alternative-id":["S1571066105806346"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80634-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rules and Strategies for Contextual Specialization of Constraint Logic Programs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80634-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}