{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:51Z","timestamp":1725663111396},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515173"},{"type":"electronic","value":"9783540482079"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51517-8_151","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:05:21Z","timestamp":1330203921000},"page":"452-453","source":"Crossref","is-referenced-by-count":0,"title":["A critical pair criterion for completion modulo a congruence"],"prefix":"10.1007","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nachum","family":"Dershowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. To appear in Theor. Comput. Sci. (1988).","DOI":"10.1007\/3-540-17220-3_17"},{"key":"72_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(88)80018-X","volume":"6","author":"L. Bachmair","year":"1988","unstructured":"L. Bachmair and N. Dershowitz. Critical pair criteria for completion. J. Sym. Comput. (1988) 6:1\u201318.","journal-title":"J. Sym. Comput."},{"key":"72_CR3","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Comput. (1986) 15:1155\u20131194.","journal-title":"SIAM J. Comput."},{"key":"72_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0747-7171(88)80019-1","volume":"6","author":"D. Kapur","year":"1988","unstructured":"D. Kapur, D.R. Musser, and P. Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. J. Sym. Comput. (1988) 6:19\u201336.","journal-title":"J. Sym. Comput."},{"key":"72_CR5","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"D. Knuth and P. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, ed. J. Leech, Pergamon Press, Oxford, 1970, pp. 263\u2013297."},{"key":"72_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. J. ACM (1981) 28:233\u2013264.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Eurocal '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51517-8_151.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:47Z","timestamp":1605648107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51517-8_151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515173","9783540482079"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-51517-8_151","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}