{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:01Z","timestamp":1725663061408},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_64","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:51:06Z","timestamp":1330195866000},"page":"146-156","source":"Crossref","is-referenced-by-count":9,"title":["On nontermination of Knuth-Bendix algorithm"],"prefix":"10.1007","author":[{"given":"Mikul\u00e1\u0161","family":"Hermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Pr\u00edvara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"16_CR1","unstructured":"Avenhaus,J.: On the termination of the Knuth-Bendix completion algorithm, 120\/84, Universit\u00e4t Kaiserslautern, 1984"},{"key":"16_CR2","unstructured":"Dershowitz,N.: Termination of rewriting; Report R-85-1220, University of Illinois at Urbana-Champaign, presented at 1st Int. Conf. on Rewriting Techniques and Applications (Dijon, France, May 85)"},{"key":"16_CR3","unstructured":"Dershowitz,N.-Marcus,L.-Tarlecki,A.: Existence, uniqueness, and construction of rewrite systems; unpublished manuscript, 1985"},{"key":"16_CR4","unstructured":"Hermann,M.-Pr\u00edvara,I.: On nontermination of Knuth-Bendix algorithm; Research report VUSEI-AR-OPS-3\/85"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems; JACM 27, 4 (1980), 797\u2013821.","journal-title":"JACM"},{"key":"16_CR6","first-page":"11","volume":"23","author":"G. Huet","year":"1980","unstructured":"Huet, G.: A complete proof of correctness of the Knuth-Bendix completion algorithm; Rapport 25, INRIA, 1980, also JCSS 23 (1980), 11\u201321","journal-title":"JCSS"},{"key":"16_CR7","unstructured":"Knuth,D.E.-Bendix,P.: Simple word problems in universal algebras; in Computational Problems in Abstract Algebra (Ed. J.Leech), Pergamon Press"},{"key":"16_CR8","unstructured":"Kirchner,H.: Preuves par compl\u00e9tion dans les vari\u00e9t\u00e9s d'alg\u00e8bres; Th\u00e8se de doctorat d'Etat, Universit\u00e9 de Nancy"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:09Z","timestamp":1619557509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}