{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:31Z","timestamp":1725664351492},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592006"},{"type":"electronic","value":"9783540492238"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59200-8_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:07:29Z","timestamp":1330276049000},"page":"71-85","source":"Crossref","is-referenced-by-count":0,"title":["Completion for multiple reduction orderings"],"prefix":"10.1007","author":[{"given":"Masahito","family":"Kurihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisashi","family":"Kondo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azuma","family":"Ohuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","unstructured":"Avenhaus J. and Madlener, K., Term rewriting and equational reasoning, Banerji, R.B. ed., Formal Techniques in Artificial Intelligence: A Sourcebook, North-Holland, 1\u201344, 1990."},{"key":"7_CR2","unstructured":"Bachmair, L., Dershowitz, N., and Hsiang, J., Orderings for equational proofs, Proc. Symp. on Logic in Computer Science, 346 357, 1986."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Canonical Equational Proofs, Birkh\u00e4user, 1991.","DOI":"10.1007\/978-1-4684-7118-2"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Completion and its applications, A\u00eft-Kaci, H. and Nivat, M. eds., Resolution of Equations in Algebraic Structures, Vol.2: Rewriting Techniques, Academic Press, 31 85, 1989.","DOI":"10.1016\/B978-0-12-046371-8.50008-0"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Dershowitz, N. and Jouannaud, J.-P., Rewrite systems, van Leeuwen, J. ed., Handbook of Theoretical Computer Science, vol. B, North-Holland, 243 320, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"7_CR6","unstructured":"Huet, G. and Oppen, D. C., Equations and rewrite rules: a survey, Book, R. ed., Formal Language Theory: Perspectives and Open Problems, Academic Press, 349 405, 1980."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"11 21","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G. Huet","year":"1981","unstructured":"Huet, G., A complete proof of correctness of the Knuth and Bendix completion algorithm, J. Comput. Syst. Sci. 23, 11 21, 1981.","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Klop, J.W., Term rewriting systems, Abramsky, S., et al. eds., Handbook of Logic in Computer Science, vol. II, Oxford Univ. Press, 1 116, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Knuth, D.E. and Bendix, P.B., Simple word problems in universal algebras, Leech, J. ed., Computational Problems in Abstract Algebra, Pargamon Press, 263 297, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"7_CR10","first-page":"41","volume":"28","author":"P. Lescanne","year":"1989","unstructured":"Lescanne, P., Completion procedures as transition rules + control, Proc. TAP-SOFT (vol. 1), Lect. Notes in Comput. Sci. 351, 28 41, 1989.","journal-title":"Proc. TAP-SOFT (vol. 1), Lect. Notes in Comput. Sci. 351"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Plaisted, D. A., Equational reasoning and term rewriting systems, Gabbay, D. M. et al. eds., Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1, Oxford Univ. Press, 274 367, 1993.","DOI":"10.1093\/oso\/9780198537458.003.0005"},{"key":"7_CR12","unstructured":"Steinbach, J. and K\u00fchler, U., Check your ordering termination proofs and open problems, SEKI report, SR-90-25 (SFB), 1990."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59200-8_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:27:55Z","timestamp":1713630475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59200-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592006","9783540492238"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59200-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}