{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:27Z","timestamp":1725663327224},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540128687"},{"type":"electronic","value":"9783540387565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12868-9_109","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:56:01Z","timestamp":1330192561000},"page":"255-266","source":"Crossref","is-referenced-by-count":1,"title":["The construction of a complete minimal set of contextual normal forms"],"prefix":"10.1007","author":[{"given":"Monique","family":"Rice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"25_CR1","unstructured":"HSIANG J.: Topics in automated theorem proving and program generation. (Ph. D. Thesis U. of Urbana, Illinois 82)"},{"issue":"1","key":"25_CR2","first-page":"797","volume":"23","author":"G. Huet","year":"1980","unstructured":"HUET G.: A complete proof of correctness of the Knuth-Bendix completion algorithm. (J.C.S.S. 23,1,27,4,pp. 797\u2013821 (1980))","journal-title":"J.C.S.S."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"HUET G. HULLOT J.M.: Proofs by induction in equational theories with constructors. (Proc. 21th Symposium on Foundation of Computer Science 1980)","DOI":"10.1109\/SFCS.1980.37"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"KNUTH D. BENDIX P.: Simple word problems in universal algebras in computational problems in abstract algebras. (Leech J. ed. Pergamon Press, pp. 263\u2013297 (1970))","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"LESCANNE P.: Computer experiments with REVE term rewriting system generators. (proc. of 10th P.O.P.L. 1983)","DOI":"10.1145\/567067.567078"},{"key":"25_CR6","unstructured":"NELSON Nils: Artificial intelligence method (ch. 6 p. 156\u2013183)"},{"key":"25_CR7","unstructured":"REMY J.L.: Etude des syst\u00e8mes de r\u00e9ecriture conditionnelle et application aux sp\u00e9cifications alg\u00e9briques de types abstraits. (Th\u00e8se d'Etat de l'I.N.P.L. Nancy 1982)"},{"key":"25_CR8","unstructured":"REMY J.L: Proving conditional identities by equation case reasoning rewriting and normalization. (82 R085 CRIN82)"},{"key":"25_CR9","unstructured":"RICE M.: Implantation d'un algorithme de calcul des ensembles complets minimaux de formes normales contextuelles pour un syst\u00e8me de r\u00e9ecriture conditionel. (Rapport 82-R-075, C.R.I.N. 1982)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12868-9_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:29Z","timestamp":1605643589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12868-9_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540128687","9783540387565"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-12868-9_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}