{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:20Z","timestamp":1725663680100},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_129","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:19:50Z","timestamp":1330262390000},"page":"33-46","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Transforming constraint logic programs"],"prefix":"10.1007","author":[{"given":"N.","family":"Bensaou","sequence":"first","affiliation":[]},{"given":"I.","family":"Guessarian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/78942.78947","volume":"12","author":"A. Bossi","year":"1990","unstructured":"A. Bossi; N. Cocco; S. Dulli. A method for specializing logic programs. ACM Trans on programming langages and systems, Vol. 12, 2, April 1990, 253\u2013302.","journal-title":"ACM Trans on programming langages and systems"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"R.M. Burstall; J. Darlington. A transformation system for deriving recursive programs, JACM, Vol. 24, 1, 1977.","journal-title":"JACM"},{"key":"3_CR3","first-page":"511","volume":"480","author":"F. Denis","year":"1991","unstructured":"F. Denis, J.P. Delahaye. Unfolding, procedural and fixpoint semantics of logic programs Proc. STACS'1991, LNCS 480, 1991, 511\u2013522.","journal-title":"LNCS"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi; G. Levi; M. Martelli; C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages, Theoretical Computer Science 69, 1989, 289\u2013318.","journal-title":"Theoretical Computer Science"},{"key":"3_CR5","unstructured":"M Gabbrielli; G. Levi. Modeling answer constraints in Constraint Logic Programs. Proc. eight int. conf. on Logic Programming, eds. Koichi & Furukawa, 1991, 238\u2013252."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. Jaffar; J.L. Lassez. Constraint logic programming, Proc. fourteenth ACM symp. on principles of programming languages, 1987, 111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"J. Jaffar; J.L. Lassez. Constraint logic programming, Tech. report, Department of Computer Science, Monash university, June 1986.","DOI":"10.1145\/41625.41635"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"P. Kanellakis; G. Kuper; P. Revesz. Constraint Query Languages, Tech. report, Department of Computer Science, Brown university, November 1990.","DOI":"10.1145\/298514.298582"},{"key":"3_CR9","unstructured":"G. Levi. Models, unfolding rules and fixpoint semantics, Proc.of the fifth international conf. on Logic programming, 1988, 1649\u20131665."},{"key":"3_CR10","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":"J.W. Lloyd. Foundations of logic programming, Springer-Verlag, Berlin, 1987."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/B978-0-934613-40-8.50020-8","volume-title":"Fondations of Deductive Databases and Logic Programming","author":"M.J. Maher","year":"1988","unstructured":"M.J. Maher. Equivalences of logic programs, Fondations of Deductive Databases and Logic Programming, J. Minker Ed., Morgan-Kaufmann, Los Altos, 1988, 627\u2013658."},{"key":"3_CR12","unstructured":"M.J.Maher. Correctness of a logic program transformation system, IBM Research Report RC 13496, T.J. Watson Research center, 1987."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","volume":"110","author":"M.J. Maher","year":"1993","unstructured":"M.J. Maher, A transformation system for deductive database modules with perfect model semantics. Theoretical Computer Science 110, 1993, 377\u2013403.","journal-title":"Theoretical Computer Science"},{"key":"3_CR14","unstructured":"A. Parrain; P. Devienne; P. Lebegue. Techniques de transformations de programmes g\u00e9n\u00e9raux et validation de meta-interpr\u00e9teurs, BIGRE 1991."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.3233\/FI-1993-182-413","volume":"18","author":"M. Proietti","year":"1993","unstructured":"M. Proietti, A. Pettorossi. An abstract strategy for transforming logic programs, Fundamenta Informaticae, Vol. 18, 1993, 267\u2013286.","journal-title":"Fundamenta Informaticae"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/115866.115895","volume":"9","author":"M. Proietti","year":"1991","unstructured":"M. Proietti, A. Pettorossi. Semantics preserving transformation rules for Prolog, Proc. PEPM'91, ACM-SIGPLAN 9, 1991, 274\u2013284.","journal-title":"ACM-SIGPLAN"},{"key":"3_CR17","unstructured":"H. Tamaki; T. Sato. Unfold\/Fold transformation of logic programs, Proc. 2nd logic programming conference, Uppsala, Sweden, 1984."}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:42:56Z","timestamp":1640929376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}