{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:08:30Z","timestamp":1725890910304},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650744"},{"type":"electronic","value":"9783540496748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49674-2_3","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T01:41:54Z","timestamp":1187055714000},"page":"49-68","source":"Crossref","is-referenced-by-count":2,"title":["Generalised Logic Program Transformation Schemas"],"prefix":"10.1007","author":[{"given":"Halime","family":"B\u00fcy\u00fcky\u0131ld\u0131z","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,18]]},"reference":[{"key":"3_CR1","unstructured":"T. Batu. Schema-Guided Transformations of Logic Algorithms. Senior Project Report, Bilkent University, Department of Computer Science, 1996."},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"R.S. Bird","year":"1984","unstructured":"R.S. Bird. The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems 6(4):487\u2013504, 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR3","unstructured":"R.S. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall, 1988."},{"key":"3_CR4","unstructured":"H. B\u00fcy\u00fcky\u0131ld\u0131z and P. Flener. Correctness Proofs of Transformation Schemas. Technical Report BU-CEIS-9713. Bilkent University, Department of Computer Science, 1997."},{"key":"3_CR5","unstructured":"H. B\u00fcy\u00fcky\u0131ld\u0131z. Schema-based Logic Program Transformation. M.Sc. Thesis, Technical Report BU-CEIS-9714. Bilkent University, Department of Computer Science, 1997."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"E. Chasseur and Y. Deville. Logic program schemas, semi-unification, and constraints. In: N.E. Fuchs (ed), Proc. of LOPSTR\u201997 (this volume).","DOI":"10.1007\/3-540-49674-2_4"},{"key":"3_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-62718-9_3","volume-title":"Proc. of LOPSTR\u201996","author":"A. Cortesi","year":"1997","unstructured":"A. Cortesi, B. Le Charlier, and S. Rossi. Specification-based automatic verification of Prolog programs. In: J. Gallagher (ed), Proc. of LOPSTR\u201996, pp. 38\u201357. LNCS 1207. Springer-Verlag, 1997."},{"issue":"5","key":"3_CR8","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S.K. Debray","year":"1993","unstructured":"S.K. Debray and N.W. Lin. Cost analysis of logic programs. ACM TOPLAS 15(5):826\u2013875, 1993.","journal-title":"ACM TOPLAS"},{"key":"3_CR9","unstructured":"Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990."},{"key":"3_CR10","unstructured":"Y. Deville and J. Burnay. Generalization and program schemata: A step towards computer-aided construction of logic programs. In: E.L. Lusk and R.A. Overbeek (eds), Proc. of NACLP\u201989, pp. 409\u2013425. The MIT Press, 1989."},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-60939-3_13","volume-title":"Proc. of LOPSTR\u201995","author":"P. Flener","year":"1996","unstructured":"P. Flener and Y. Deville. Logic program transformation through generalization schemata. In: M. Proietti (ed), Proc. of LOPSTR\u201995, pp. 171\u2013173. LNCS 1048. Springer-Verlag, 1996."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"P. Flener, K.-K. Lau, and M. Ornaghi. On correct program schemas. In: N.E. Fuchs (ed), Proc. of LOPSTR\u201997 (this volume).","DOI":"10.1007\/3-540-49674-2_7"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"N.E. Fuchs and M.P.J. Fromherz. Schema-based transformation of logic programs. In: T. Clement and K.-K. Lau (eds), Proc. of LOPSTR\u201991, pp. 111\u2013125. Springer Verlag, 1992.","DOI":"10.1007\/978-1-4471-3494-7_9"},{"key":"3_CR14","unstructured":"T.S. Gegg-Harrison. Representing logic program schemata in \u03bbProlog. In: L. Sterling (ed), Proc. of ICLP\u201995, pp. 467\u2013481. The MIT Press, 1995."},{"key":"3_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-62718-9_15","volume-title":"Proc. of LOPSTR\u201996","author":"T.S. Gegg-Harrison","year":"1997","unstructured":"T.S. Gegg-Harrison. Extensible logic program schemata. In: J. Gallagher (ed), Proc. of LOPSTR\u201996, pp. 256\u2013274. LNCS 1207. Springer-Verlag, 1997."},{"key":"3_CR16","unstructured":"A. Hamfelt and J. Fischer Nilsson. Declarative logic programming with primitive recursion relations on lists. In: L. Sterling (ed), Proc of JICSLP\u201996. The MIT Press."},{"issue":"20","key":"3_CR17","doi-asserted-by":"publisher","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. Journal of Logic Programming 19(20):261\u2013320, 1994.","journal-title":"Journal of Logic Programming"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"J. Richardson and N.E. Fuchs. Development of correct transformation schemata for Prolog programs. In: N.E. Fuchs (ed), Proc. of LOPSTR\u201997 (this volume).","DOI":"10.1007\/3-540-49674-2_14"},{"key":"3_CR19","unstructured":"D. Sahlin. An Automatic Partial Evaluator of Full Prolog. Ph.D. Thesis, Swedish Institute of Computer Science, 1991."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0004-3702(85)90083-9","volume":"27","author":"D.R. Smith","year":"1985","unstructured":"D.R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27(1):43\u201396, 1985.","journal-title":"Artificial Intelligence"},{"issue":"9","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/32.58788","volume":"16","author":"D.R. Smith","year":"1990","unstructured":"D.R. Smith. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering 16(9):1024\u20131043, 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR22","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. Mercury: An efficient purely declarative logic programming language. In: Proc. of the Australian Computer Science Conference, pp. 499\u2013512, 1995."},{"key":"3_CR23","unstructured":"L.S. Sterling and M. Kirschenbaum. Applying techniques to skeletons. In: J.-M. Jacquet (ed), Constructing Logic Programs, pp. 127\u2013140, John Wiley, 1993."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(92)90168-F","volume":"104","author":"M.E. Stickel","year":"1992","unstructured":"M.E. Stickel. A Prolog technology theorem prover: A new exposition and implementation in Prolog. Theoretical Computer Science 104:109\u2013128, 1992.","journal-title":"Theoretical Computer Science"},{"key":"3_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-60939-3_14","volume-title":"Proc. of LOPSTR\u201995","author":"W.W. Vasconcelos","year":"1996","unstructured":"W.W. Vasconcelos and N.E. Fuchs. An opportunistic approach for logic program analysis and optimisation using enhanced schema-based transformations. In: M. Proietti (ed), Proc. of LOPSTR\u201995, pp. 174\u2013188. LNCS 1048. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49674-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T15:55:01Z","timestamp":1550764501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49674-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650744","9783540496748"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-49674-2_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}