{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:41Z","timestamp":1725663341855},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_296","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:30:07Z","timestamp":1330176607000},"page":"402-404","source":"Crossref","is-referenced-by-count":9,"title":["Implementation of a general completion procedure parameterized by built-in theories and strategies"],"prefix":"10.1007","author":[{"given":"Claude","family":"Kirchner","sequence":"first","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"68_CR1","unstructured":"R. Forgaard and J.V. Guttag: \u201dREVE: A Term Rewriting System Generator with Failure-Resistant Knuth-Bendix\u201d Technical Report MIT-LCS (1984)"},{"key":"68_CR2","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27\u20134","author":"G. Huet","year":"1980","unstructured":"G. Huet: \u201dConfluent reductions: abstract properties and applications to term rewriting systems\u201d JACM 27\u20134, p. 797\u2013821 (1980)","journal-title":"JACM"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"J.P. Jouannaud and H. Kirchner: \u201dCompletion of a set of rules modulo a set of equations\u201d Proceedings 11th ACM Conference of Principles of Programming Languages, (1984). To appear in SIAM Journal of Computing.","DOI":"10.1145\/800017.800519"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"C. Kirchner and H. Kirchner: \u201dImplementation of General Completion Procedure Parameterized by Built-in Theories And Strategies\u201d Rapport Crin 84-R-85 (1984).","DOI":"10.1007\/3-540-15984-3_296"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"D. Knuth and P. Bendix: \u201dSimple Word Problems in Universal Algebras\u201d Computational Problems in Abstract Algebra Ed. Leech J., Pergamon Press p. 263\u2013297 (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"P. Lescanne: \u201dComputer Experiments with the REVE Term Rewriting System Generator\u201d 10th ACM Conf. on Principles of Programming Languages Austin Texas p.99\u2013108 (1983)","DOI":"10.1145\/567067.567078"},{"key":"68_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28\u20132","author":"G. Peterson","year":"1981","unstructured":"G. Peterson and M. Stickel: \u201dComplete sets of reduction for equational theories with complete unification algorithms\u201d JACM 28\u20132, p. 233\u2013264 (1981)","journal-title":"JACM"}],"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_296.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:09:22Z","timestamp":1605625762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15984-3_296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159841","9783540396857"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-15984-3_296","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}