{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:02:06Z","timestamp":1760061726577},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_4","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T05:41:54Z","timestamp":1187070114000},"page":"69-89","source":"Crossref","is-referenced-by-count":12,"title":["Logic Program Schemas, Constraints, and Semi-unification"],"prefix":"10.1007","author":[{"given":"Eric","family":"Chasseur","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,18]]},"reference":[{"key":"4_CR1","unstructured":"H. B\u00fcy\u00fcky\u0131ld\u0131z and P. Flener, Generalized logic program transformation schemas, In: N.E. Fuchs (ed.), Proc. of LOPSTR\u201997 (this volume)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0743-1066(94)90029-9","volume":"19\u201320","author":"Y. Deville","year":"1994","unstructured":"Y. Deville and K.-K. Lau, Logic program synthesis: A survey, Journal of Logic Programming, 19\u201320:321\u2013350, May\/July 1994","journal-title":"Journal of Logic Programming"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"P. Flener, Logic Program Synthesis From Incomplete Information, Kluwer Academic Publishers, 1995","DOI":"10.1007\/978-1-4615-2205-8"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Flener and Y. Deville, Logic program transformation through generalization schemata, In: M. Proietti (ed.), Proc. of LOPSTR\u201995, Springer-Verlag, 1996","DOI":"10.1007\/3-540-60939-3_13"},{"key":"4_CR5","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":"4_CR6","doi-asserted-by":"crossref","unstructured":"N.E. Fuchs and M.P.J. Fromherz, Schema-Based Transformations of Logic Programs, In: T.P. Clement, K.-K. Lau (eds.), Proc. of LOPSTR\u201991, Springer-Verlag, 1992","DOI":"10.1007\/978-1-4471-3494-7_9"},{"key":"4_CR7","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, W.H. Freeman and Company, 1979"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00120881","volume":"20","author":"T.S. Gegg-Harrison","year":"1991","unstructured":"T.S. Gegg-Harrison, Learning Prolog in a Schema-Based Environment, Instructional Science, 20:173\u2013192, 1991","journal-title":"Instructional Science"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"T.S. Gegg-Harrison, Representing Logic Program Schemata in \u03b3 Prolog, In: L. Sterling (ed.), Proc. of the 12th International Conference on Logic Programming, Japan, pp. 467\u2013481, The MIT Press, 1995","DOI":"10.7551\/mitpress\/4298.003.0049"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"T.S. Gegg-Harrison, Extensible Logic Program Schemata, In: J. Gallagher (ed.), Proc. of the 6th International Workshop on Logic Program Synthesis and Transformation, Stockholm, Sweden, pp. 256\u2013274, Springer-Verlag, 1996","DOI":"10.1007\/3-540-62718-9_15"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","volume":"13","author":"W.D. Goldfarb","year":"1981","unstructured":"W.D. Goldfarb, The Undecidability of the second-order unification problem, Theoretical Computer Science, 13:225\u2013230, 1981","journal-title":"Theoretical Computer Science"},{"key":"4_CR12","unstructured":"J. Hannan and D. Miller, Uses Of Higher-Order Unification For Implementing Program Transformers, In: A. Kowalski, K.A. Bowen (eds.), Proc. of ICLP\u201988, The MIT Press, 1988"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"G. Huet, A unification algorithm for lambda calculus, Theoretical Computer Science, 1:27\u201357, 1975","journal-title":"Theoretical Computer Science"},{"key":"4_CR14","unstructured":"G. Huet, R\u00e9solution d\u2019\u00c9quations dans les langages d\u2019ordre 1, 2...\u03c9, PhD thesis, Universit\u00e9 Paris VII, 1976"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF00264598","volume":"11","author":"G. Huet","year":"1978","unstructured":"G. Huet and B. Lang, Proving and Applying Program Transformations Expressed with Second-Order Patterns, Acta Informatica 11 (1978), 31\u201355","journal-title":"Acta Informatica"},{"key":"4_CR16","unstructured":"I. Kraan, D. Basin and A. Bundy, Middle-Out Reasoning for Logic Program Synthesis, In: D.S. Warren (ed.), Proc. of ICLP\u201993, The MIT Press, 1993"},{"key":"4_CR17","unstructured":"D. Miller and G. Nadathur, A logic programming approach to manipulating formulas and programs, Proc. of the IEEE Fourth Symposium on Logic Programming, IEEE Press, 1987"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari, An Efficient Unification Algorithm, ACM Transactions on Programming Languages and Systems, Vol. 4, No. 2, April 1982, pp.258\u2013282","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"T. Nipkow, Higher-order critical pairs, In: Proc. 6th IEEE Symp. Logic in Computer Science, pp. 342\u2013349, 1991","DOI":"10.1109\/LICS.1991.151658"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"J. Richardson and N.E. Fuchs, Development of correct transformation schemata for Prolog programs, In: N.E. Fuchs (e.), Proc. of LOPSTR\u201997 (this volume).","DOI":"10.1007\/3-540-49674-2_14"},{"issue":"1\u20133","key":"4_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Z. Somogyi, F. Henderson and T. Conway, The execution algorithm of Mercury:. an efficient purely declarative logic programming language, Journal of Logic Programming, 29(1\u20133):17\u201364, October\u2013December 1996","journal-title":"Journal of Logic Programming"},{"key":"4_CR22","unstructured":"W.W. Vasconcelos and N.E. Fuchs, Enhanced Schema-Based Transformations for. Logic Programs and their Opportunistic Usage in Program Analysis and Optimisation, technical report, Institut f\u00fcr Informatik, Universit\u00e4t Z\u00fcrich, 1995"},{"key":"4_CR23","doi-asserted-by":"crossref","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, Springer-Verlag, 1996","DOI":"10.1007\/3-540-60939-3_14"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:01:46Z","timestamp":1708167706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49674-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650744","9783540496748"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-49674-2_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}