{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:33:58Z","timestamp":1758270838563,"version":"3.41.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1006129631807","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T00:53:09Z","timestamp":1040518389000},"page":"25-42","source":"Crossref","is-referenced-by-count":13,"title":["Completion for Multiple Reduction Orderings"],"prefix":"10.1007","volume":"23","author":[{"given":"Masahito","family":"Kurihara","sequence":"first","affiliation":[]},{"given":"Hisashi","family":"Kondo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Avenhaus, J. and Madlener, K.: Term rewriting and equational reasoning, in R. B. Banerji (ed.), Formal Techniques in Artificial Intelligence: A Sourcebook, North-Holland, 1990, pp. 1\u201344.","key":"189513_CR1"},{"unstructured":"Bachmair, L., Dershowitz, N., and Hsiang, J.: Orderings for equational proofs, in Proc. IEEE Symposium on Logic in Computer Science, 1986, pp. 346\u2013357.","key":"189513_CR2"},{"doi-asserted-by":"crossref","unstructured":"Bachmair, L., Dershowitz, N., and Plaisted, D. A.: Completion without failure, in H. A\u00eft-Kaci and M. Nivat (eds.), Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, Academic Press, 1989, pp. 1\u201330.","key":"189513_CR3","DOI":"10.1016\/B978-0-12-046371-8.50007-9"},{"doi-asserted-by":"crossref","unstructured":"Bachmair, L.: Canonical Equational Proofs, Birkh\u00e4user, 1991.","key":"189513_CR4","DOI":"10.1007\/978-1-4684-7118-2"},{"doi-asserted-by":"crossref","unstructured":"Dershowitz, N.: Completion and its applications, in H. A\u00eft-Kaci and M. Nivat (eds.), Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, Academic Press, 1989, pp. 31\u201385.","key":"189513_CR5","DOI":"10.1016\/B978-0-12-046371-8.50008-0"},{"doi-asserted-by":"crossref","unstructured":"Dershowitz, N. and Jouannaud, J.-P.: Rewrite systems, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. B, North-Holland, 1990, pp. 243\u2013320.","key":"189513_CR6","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"doi-asserted-by":"crossref","unstructured":"Detlefs, D. and Forgaad, R.: A procedure for automatically proving the termination of a set of rewrite rules, in Proc. 1st Conf. on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci. 202, 1985, pp. 255\u2013270.","key":"189513_CR7","DOI":"10.1007\/3-540-15976-2_12"},{"doi-asserted-by":"crossref","unstructured":"Huet, G. and Oppen, D. C.: Equations and rewrite rules: A survey, in R. Book (ed.), Formal Language Theory: Perspectives and Open Problems, Academic Press, 1980, pp. 349\u2013405.","key":"189513_CR8","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"189513_CR9","doi-asserted-by":"crossref","first-page":"11","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. System Sci.\n23 (1981), 11\u201321.","journal-title":"J. Comput. System Sci."},{"doi-asserted-by":"crossref","unstructured":"Klop, J. W.: Term rewriting systems, in S. Abramsky et al. (eds.), Handbook of Logic in Computer Science, vol. 2, Oxford Univ. Press, 1992, pp. 1\u2013116.","key":"189513_CR10","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"doi-asserted-by":"crossref","unstructured":"Knuth, D. E. and Bendix, P. B.: Simple word problems in universal algebras, in J. Leech (ed.), Computational Problems in Abstract Algebra, Pargamon Press, 1970, pp. 263\u2013297.","key":"189513_CR11","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"189513_CR12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-50939-9_123","volume":"1","author":"P. Lescanne","year":"1989","unstructured":"Lescanne, P.: Completion procedures as transition rules + control, in Proc. TAPSOFT, vol. 1, Lecture Notes in Comput. Sci. 351, 1989, pp. 28\u201341.","journal-title":"Proc. TAPSOFT"},{"doi-asserted-by":"crossref","unstructured":"Plaisted, D. A.: Equational reasoning and term rewriting systems, in D. M. Gabbay et al. (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 1, Oxford Univ. Press, 1993, pp. 274\u2013367.","key":"189513_CR13","DOI":"10.1093\/oso\/9780198537458.003.0005"},{"key":"189513_CR14","series-title":"SEKI report","volume-title":"Check your ordering \u2013 termination proofs and open problems","author":"J. Steinbach","year":"1990","unstructured":"Steinbach, J. and K\u00fchler, U.: Check your ordering \u2013 termination proofs and open problems, SEKI report SR-90-25 (SFB), Fachbereich Informatik, Universit\u00e4t Kaiserslautern, Germany, 1990."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006129631807.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006129631807\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006129631807.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:33:19Z","timestamp":1749123199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006129631807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["189513"],"URL":"https:\/\/doi.org\/10.1023\/a:1006129631807","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}