{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:01Z","timestamp":1725456121242},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603597"},{"type":"electronic","value":"9783540450481"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0026815","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:29:45Z","timestamp":1132378185000},"page":"81-96","source":"Crossref","is-referenced-by-count":0,"title":["A new calculus for semantic matching"],"prefix":"10.1007","author":[{"given":"Bernd","family":"B\u00fctow","sequence":"first","affiliation":[]},{"given":"Robert","family":"Giegerich","sequence":"additional","affiliation":[]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Thesing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages, pages 268\u2013278. ACM Press, 1994.","DOI":"10.1145\/174675.177899"},{"key":"7_CR2","unstructured":"B. B\u00fctow and S. Thesing. Reverse restrucuring: Another method of solving algebraic equations. Forschungsberichte der Technischen Fakult\u00e4t, Abteilung Informationstechnik, Report 94-07, Universit\u00e4t Bielefeld, 1994."},{"key":"7_CR3","unstructured":"B. B\u00fctow and S. Thesing. PaNaMa user's manual. Forschungsberichte der Technischen Fakult\u00e4t, Abteilung Informationstechnik, Report 95-01, Universit\u00e4t Bielefeld, 1995."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. Elsevier Science Publisher B.V., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, S. Mitra, and G. Sivakumar. Decidable matching for convergent systems. In Proceedings of the 11th Conference on automatic deduction (CADE), pages 133\u2013146, 1992.","DOI":"10.1007\/3-540-55602-8_194"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and G. Sivakumar. Solving goals in equational languages. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings of the 1st International Workshop on Conditional Term Rewriting Systems, volume 308 of Lecture Notes in Computer Science, pages 45\u201355, Orsay, France, July 1987.","DOI":"10.1007\/3-540-19242-5_4"},{"key":"7_CR7","unstructured":"H. Emmelmann. Codeselektion mit regul\u00e4r gesteuerter Termersetzung. PhD thesis, Universit\u00e4t Karlsruhe, 1994."},{"key":"7_CR8","first-page":"227","volume":"24","author":"H. Emmelmann","year":"1989","unstructured":"H. Emmelmann, F.-W. Schr\u00f6er, and R. Landwehr. BEG \u2014 a generator for efficient back ends. In Sigplan '89 Conference on Programming Language Design and Implementation, volume 24, pages 227\u2013237. Sigplan Notices, 1989.","journal-title":"Sigplan '89 Conference on Programming Language Design and Implementation"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/131080.131089","volume":"27","author":"C. Fraser","year":"1992","unstructured":"C. Fraser, R. Henry, and T. Proebsting. BURG \u2014 fast optimal instruction selection and tree parsing. ACM Sigplan Notices, 27:pages 68\u201376, 1992.","journal-title":"ACM Sigplan Notices"},{"issue":"6","key":"7_CR10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"R.W. Floyd. Algorithm 97. Communications of the ACM, 5(6):page 345, 1962.","journal-title":"Communications of the ACM"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(90)90145-8","volume":"73","author":"R. Giegerich","year":"1990","unstructured":"R. Giegerich. Code selection by inversion of order-sorted derivors. Theoretical Computer Science, 73:pages 177\u2013211, 1990.","journal-title":"Theoretical Computer Science"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:pages 583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"7_CR13","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, 1992."},{"key":"7_CR14","unstructured":"S. Mitra. Top-down equation solving and extensions to associative and commutative theories. Masters thesis, Department of Computer and Information Sciences, University of Delaware, 1990."},{"key":"7_CR15","unstructured":"S. Mitra. Semantic Unification for Convergent Systems. PhD thesis, University of Illinois, 1994."},{"issue":"2","key":"7_CR16","doi-asserted-by":"crossref","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 (TOPLAS), 4(2):pages 258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"7_CR17","first-page":"245","volume-title":"Resolution of Equations in Algebraic Strucutures","author":"A. Martelli","year":"1989","unstructured":"A. Martelli, C. Moiso, and G.F. Rossi. Lazy unification algorithms for canonical rewrite systems. In H. Ait-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Strucutures, pages 245\u2013274, New York, 1989. Academic Press."},{"issue":"1","key":"7_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):pages 11\u201312, 1962.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T20:27:39Z","timestamp":1549312059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603597","9783540450481"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0026815","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}