{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T23:40:49Z","timestamp":1684539649403},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1007\/bf02948837","type":"journal-article","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:26:39Z","timestamp":1221265599000},"page":"552-559","source":"Crossref","is-referenced-by-count":0,"title":["Partial completion of equational theories"],"prefix":"10.1007","volume":"15","author":[{"given":"Yongqiang","family":"Sun","sequence":"first","affiliation":[]},{"given":"Kai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Chaojun","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02948837_CR1","doi-asserted-by":"crossref","unstructured":"Knuth D E, Bendix P B. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, Leech J (ed.), Pergamon Press, 1970, pp. 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"BF02948837_CR2","doi-asserted-by":"crossref","unstructured":"Huet G, Oppen D C. Equations and rewrite rules: A survey. InFormal Language Theory: Perspectives and Open Problems, Book R V (ed.), Academic Press, 1980, pp. 349\u2013405.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"BF02948837_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G Huet","year":"1981","unstructured":"Huet G. A complete proof of correctness of the Knuth-Bendix completion algorithm.Journal of Computer Science and System, 1981, 23:11\u201321.","journal-title":"Journal of Computer Science and System"},{"key":"BF02948837_CR4","series-title":"Tech. Rep. CSL-113","doi-asserted-by":"crossref","DOI":"10.21236\/ADA087641","volume-title":"A catalogue of canonical term rewriting systems","author":"J Hullet","year":"1980","unstructured":"Hullet J. A catalogue of canonical term rewriting systems. Tech. Rep. CSL-113, SRI International, Menlo Park, California, 1980."},{"key":"BF02948837_CR5","doi-asserted-by":"crossref","unstructured":"Dershowitz N, Jouannaud J-P. Rewrite systems. InHandbook of Theoretical Computer Science B: Formal Methods and Semantics, Leeuwen J Van (ed.), North-Holland, 1990, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"12","key":"BF02948837_CR6","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","volume":"21","author":"J V Guttag","year":"1978","unstructured":"Guttag J V, Horowitz E, Musser D R. Abstract data types and software validation.Communications of ACM, 1978, 21(12): 1048\u20131064.","journal-title":"Communications of ACM"},{"key":"BF02948837_CR7","doi-asserted-by":"crossref","unstructured":"Goguen J, Meseguer J. Equality, type module and generics for logic programming. InLogic Programming Symposium. Sweden, 1984, pp. 22\u201326.","DOI":"10.1016\/0743-1066(84)90004-9"},{"key":"BF02948837_CR8","first-page":"4","volume":"15","author":"G Peterson","year":"1986","unstructured":"Peterson G. A technique for establishing completeness results in theorem proving with equality.SIAM J. Comp., 1986, 15:4.","journal-title":"SIAM J. Comp."},{"key":"BF02948837_CR9","unstructured":"Jouannaud J-P. Church-Rosser computations with equational term rewriting system.LNCS 159, 1988, pp. 85\u201397."},{"issue":"2","key":"BF02948837_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G E Peterson","year":"1981","unstructured":"Peterson G E, Stickel M E. Complete sets of reductions for some equational theories.Journal of ACM, 1981, 28(2): 233\u2013264.","journal-title":"Journal of ACM"},{"issue":"4","key":"BF02948837_CR11","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J-P Jouannaud","year":"1986","unstructured":"Jouannaud J-P, Kirchner H. Completion of a set of rules modulo a set of equations.SIAM J. Comp., 1986, 15(4): 1155\u20131194.","journal-title":"SIAM J. Comp."},{"key":"BF02948837_CR12","first-page":"33","volume":"69","author":"L Bachmair","year":"1989","unstructured":"Bachmair L, Dershowitz N. Completion for rewriting modulo a congruence.Theoretical Computer Science 69, 1989, pp. 33\u201352.","journal-title":"Theoretical Computer Science"},{"key":"BF02948837_CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(85)90074-8","volume":"25","author":"J Hsiang","year":"1985","unstructured":"Hsiang J. Refutational theorem proving using term-rewriting systems.Artificial Intelligence, 1985, 25: 255\u2013300.","journal-title":"Artificial Intelligence"},{"key":"BF02948837_CR14","doi-asserted-by":"crossref","unstructured":"Musser D R. On proving inductive properties of abstract data type. InProceedings of 7th POPL Conference, 1980.","DOI":"10.1145\/567446.567461"},{"key":"BF02948837_CR15","doi-asserted-by":"crossref","unstructured":"Huet G, Hullot J M. Proofs by induction in equational theories with constructors.Journal of Computer Science and System 25, 1980.","DOI":"10.1109\/SFCS.1980.37"},{"key":"BF02948837_CR16","first-page":"42","volume":"82","author":"J-P Jounnaud","year":"1989","unstructured":"Jounnaud J-P, Kounalis E. Automatic proofs by induction in theories without constructors.Information and Computation, 82, 1989, pp. 42\u201353.","journal-title":"Information and Computation"},{"issue":"4","key":"BF02948837_CR17","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.Journal of ACM, 1980, 27(4): 797\u2013821.","journal-title":"Journal of ACM"},{"key":"BF02948837_CR18","volume-title":"Combinatory reduction systems","author":"J W Klop","year":"1980","unstructured":"Klop J W. Combinatory reduction systems [dissertation]. Amsterdam: Math Centrum, 1980."},{"issue":"1","key":"BF02948837_CR19","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y Toyama","year":"1987","unstructured":"Toyama Y. On the Church-Rosser property for the direct sum of term rewriting systems.Journal of ACM, 1987, 34(1): 128\u2013143.","journal-title":"Journal of ACM"},{"issue":"4","key":"BF02948837_CR20","first-page":"1","volume":"3","author":"Kai Lin","year":"1992","unstructured":"Lin Kai, Sun Yongqiang. Semi-regular term rewriting system and its confluence.Journal of Software, 1992, 3(4): 1\u201311. (in Chinese)","journal-title":"Journal of Software"},{"key":"BF02948837_CR21","unstructured":"Lin Kai, Sun Yongqiang. Semi-linear term rewriting system and its confluence. InSelected Scientific Papers 2, Shanghai Jiao Tong University, 1991. (in Chinese)"},{"key":"BF02948837_CR22","unstructured":"Lin Kai, Sun Yongqiang. The confluence of semi-linear term rewriting systems with local confluence. Technical Report, Shanghai Jiao Tong University, 1992. (in Chinese)"},{"key":"BF02948837_CR23","unstructured":"Lin Kai, Sun Yongqiang. Pseudo-linear term rewriting system and its confluence. Technical Report, Shanghai Jiao Tong University, 1993. (in Chinese)"},{"key":"BF02948837_CR24","unstructured":"Lin Kai, Sun Yongqiang. Relative pseudo-linear term rewriting system and its confluence. InFundamental Research of Intelligent Computers, Tsinghua University Press, 1994, pp. 474\u2013482. (in Chinese)"},{"key":"BF02948837_CR25","unstructured":"Lin Kai, Sun Yongqiang. Compressed path ordering and the structure measure of term rewriting systems.Journal of Software, 1993 4(2). (in Chinese)"},{"issue":"1","key":"BF02948837_CR26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N Dershowitz","year":"1987","unstructured":"Dershowitz N. Termination of rewriting.Journal of Symbolic Computation, 1987, 3(1): 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"BF02948837_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/251621.251627","volume":"32","author":"Yongqiang Sun","year":"1997","unstructured":"Sun Yongqiang, Lin Kai, Shen Li. The design and implementation of a program development system based on rewriting method.ACM SIGPLAN Notices, 1997, 32(2): 27\u201334.","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948837.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948837\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T23:14:28Z","timestamp":1684538068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["BF02948837"],"URL":"https:\/\/doi.org\/10.1007\/bf02948837","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}