{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:43Z","timestamp":1725663343222},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159841"},{"type":"electronic","value":"9783540396857"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15984-3_294","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:30:17Z","timestamp":1330194617000},"page":"390-399","source":"Crossref","is-referenced-by-count":17,"title":["A confluence criterion based on the generalised Newman Lemma"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"K\u00fcchlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"66_CR1","first-page":"3","volume":"4","author":"B. B","year":"1970","unstructured":"Buchberger, B. Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems. Aequationes math. 4, 3 (1970).","journal-title":"Aequationes math."},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Buchberger, B. \"A Criterion for Detecting Unnecessary Reductions in the Construction of Gr\u00f6bner-Bases.\" In Symbolic and Algebraic Computation (E. Ng ed.). Lecture Notes in Computer Science, vol. 72. Springer-Verlag 1979.","DOI":"10.1007\/3-540-09519-5_52"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Buchberger, B. \"A critical pair\/ completion algorithm for finitely generated ideals in rings.\" In Logic and Machines: Decision Problems and Complexity (Proceedings of the Symposium \"Rekursive Kombinatorik\", M\u00fcnster, May 23\u201328, 1983), E. B\u00f6rger ed., Lecture Notes in Computer Science, vol. 171, Springer-Verlag 1984.","DOI":"10.1007\/3-540-13331-3_39"},{"key":"66_CR4","first-page":"4","volume":"27","author":"H. G","year":"1980","unstructured":"Huet, G. Confluent reductions: abstract properties and their applications to term rewriting systems. Journ. ACM 27, 4 (Oct 1980).","journal-title":"Journ. ACM"},{"key":"66_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"H. G","year":"1981","unstructured":"Huet, G. A complete proof of correctness of the Knuth-Bendix Completion Algorithm. Journ. Comp. Syst. Sci. 23 (1981) 11\u201321.","journal-title":"Journ. Comp. Syst. Sci."},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"Huet, G., and Oppen, D. \"Equations and rewrite rules: A survey.\" In Formal Languages: Perspectives and Open Problems (R. Book ed.). Academic Press 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"66_CR7","unstructured":"Knuth, D. E., and Bendix, P. B. \"Simple word problems in universal algebra.\" In Computational Problems in Abstract Algebra (Proceedings of a conference held in Oxford 1967, J. Leech ed.). Pergamon 1970."},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"K\u00fcchlin, W. W. \"A Theorem-Proving approach to the Knuth-Bendix Completion Algorithm.\" In Computer Algebra (Proceedings of EUROCAM'82), J. Calmet ed., Lecture Notes in Computer Science, vol. 144. Springer-Verlag 1982.","DOI":"10.1007\/3-540-11607-9_12"},{"key":"66_CR9","volume-title":"An Implementation and Investigation of the Knuth-Bendix Completion Procedure","author":"W. W. K\u00fcchlin","year":"1982","unstructured":"K\u00fcchlin, W. W. An Implementation and Investigation of the Knuth-Bendix Completion Procedure. Diplomarbeit, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karisruhe, West Germany, 1982."},{"key":"66_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"Robinson, J. A. A machine oriented logic based on the resolution principle. Journ. ACM 12, 1 (Jan 1965).","journal-title":"Journ. ACM"},{"key":"66_CR11","series-title":"Tech. Report","volume-title":"A criterion for eliminating unnecessary reductions in the Knuth-Bendix Algorithm","author":"F. Winkler","year":"1983","unstructured":"Winkler, F. A criterion for eliminating unnecessary reductions in the Knuth-Bendix Algorithm. Tech. Report 83-14.0, CAMP, Universit\u00e4t Linz, Austria, May 1983."},{"key":"66_CR12","unstructured":"Winkler, F., and Buchberger, B. \"A criterion for eliminating unnecessary reductions in the Knuth-Bendix Algorithm.\" Colloquium on Algebra, Combinatorics and Logic in Computer Science (Gy\u00f6r, Hungary, Sept 12\u201316, 1983)."}],"container-title":["Lecture Notes in Computer Science","EUROCAL '85"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15984-3_294.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:21Z","timestamp":1605643761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15984-3_294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159841","9783540396857"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-15984-3_294","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}