{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:06Z","timestamp":1725663546604},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540531623"},{"type":"electronic","value":"9783540467380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53162-9_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:00:52Z","timestamp":1330207252000},"page":"359-371","source":"Crossref","is-referenced-by-count":0,"title":["Optimization of rewriting and complexity of rewriting"],"prefix":"10.1007","author":[{"given":"Ke","family":"Li","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D. Benanav","year":"1987","unstructured":"D. Benanav, D. Kapur and P. Narendran, \u201cComplexity of matching problems,\u201d J. Symbolic Computation, Vol. 3, pp.203\u2013216, 1987.","journal-title":"J. Symbolic Computation"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"C.Choppy, S.Kaplan and M.Soria, \u201cAlgorithmic complexity of term rewriting systems,\u201d 2nd Int. Conf. on Rewriting Techniques and Applications, pp.256\u2013270, 1987.","DOI":"10.1007\/3-540-17220-3_22"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, \u201cTermination of rewriting,\u201d J. Symbolic Computation, Vol. 3, pp.69\u2013116, 1987.","journal-title":"J. Symbolic Computation"},{"key":"25_CR4","unstructured":"N. Dershowitz and J.-P. Jouannaud, \u201cRewriting systems,\u201d Draft, 1988."},{"key":"25_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, New York, 1979."},{"key":"25_CR6","unstructured":"G. Huet and J.-J. Levy, \u201cComputations in nonambiguous linear rewriting systems,\u201d Tech Rep. #359, INRIA, 1979."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"G. Huet and D.C. Oppen, \u201cEquations and rewrite rules: A survey,\u201d in Formal Languages: Perspective and Open Problems, R. Book, Ed., Academic Press, pp.349\u2013405, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"25_CR8","first-page":"318","volume":"87","author":"J.M. Hullot","year":"1980","unstructured":"J.M. Hullot, \u201cCanonical forms and unification,\u201d 5th Conf. on Automated Deduction 1980, available as LNCS 87, pp.318\u2013334, 1980.","journal-title":"LNCS"},{"key":"25_CR9","first-page":"331","volume-title":"Recursive Decomposition Ordering","author":"J.-P. Jouannaud","year":"1982","unstructured":"J.-P. Jouannaud, P. Lescanne and F. Reing, \u201cRecursive Decomposition Ordering,\u201d Proc. of the Second IFIP Workshop on Formal Description of Programming Concepts, Garmishch-Partenkirchen, West Germany, pp.331\u2013348, 1982."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud and H. Kirchner, \u201cComplete of a set of ruls modulo a set of equations,\u201d SIAM J. Comput., Vol. 15, No. 4, Nov. 1986.","DOI":"10.1137\/0215084"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"D.E. Knuth and P.B. Bendix, \u201cSimple word problems in universal algebras,\u201d in Computational Problems in Abstract Algebra, J. Leech, Ed., Pergamon Press, pp.263\u2013297, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"25_CR12","first-page":"173","volume":"185","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, P. Narendran and G. Sivakumar, \u201cA path ordering for proving termination of term rewriting systems,\u201d CAAP'85, LNCS 185, pp.173\u2013187, 1985.","journal-title":"CAAP'85, LNCS"},{"key":"25_CR13","first-page":"143","volume":"32","author":"J.W. Klop","year":"1987","unstructured":"J.W. Klop, \u201cTerm rewriting systems: A tutorial,\u201d Bulletin of the European Asso. for Theoretical Comp. Sci., Vol. 32, pp.143\u2013183, 1987.","journal-title":"Bulletin of the European Asso. for Theoretical Comp. Sci."},{"key":"25_CR14","unstructured":"Ke Li, \u201cComplexity of term rewriting\u201d, Technical Report #474, Dept. of Computer Science, New York University, 1989."},{"key":"25_CR15","unstructured":"Ke Li, \u201cApproximate and optimal strategies for non-ambiguous and left linear term rewriting systems\u201d, Technical Report #475, Dept. of Computer Science, New York University, 1989."},{"key":"25_CR16","first-page":"326","volume":"355","author":"S. Narain","year":"1989","unstructured":"S. Narain, \u201cOptimization by non-deterministic, lazy rewriting,\u201d 3rd Conf. on Rewriting Techniques and Applications, LNCS 355, pp.326\u2013342, 1989.","journal-title":"LNCS"},{"key":"25_CR17","first-page":"141","volume":"202","author":"P. Rety","year":"1985","unstructured":"P. Rety, C. Kirchner, H. Kirchner and P. Lescanne, \u201cNARROWER: a new algorithm for unification and its application to logic programming,\u201d RTA'85, LNCS 202, pp.141\u2013157, 1985.","journal-title":"RTA'85, LNCS"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53162-9_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:49Z","timestamp":1605648409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53162-9_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540531623","9783540467380"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-53162-9_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}