{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:19:01Z","timestamp":1768274341719,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf00881798","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T07:36:06Z","timestamp":1104132966000},"page":"389-397","source":"Crossref","is-referenced-by-count":2,"title":["Simplification orderings: Putting them to the test"],"prefix":"10.1007","volume":"10","author":[{"given":"Joachim","family":"Steinbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Avenhaus, J\u00fcrgen, Madlener, Klaus E., and Steinbach, Joachim, ?COMTES ? An experimental environment for the completion of term rewriting systems?, in N. Dershowitz (Ed.),Proc. 3rd RTA (LNCS 355), pp. 542?546. Chapel Hill (North Carolina), April 1989.","DOI":"10.1007\/3-540-51081-8_133"},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"Nachum Dershowitz","year":"1982","unstructured":"Dershowitz, Nachum, ?Orderings for term rewriting systems?,J. TCS,17(3), 279?301 (March 1982).","journal-title":"J. TCS"},{"key":"CR3","first-page":"69","volume":"3","author":"Nachum Dershowitz","year":"1987","unstructured":"Dershowitz, Nachum, ?Termination of rewriting?,JSC,3, 69?116 (1987).","journal-title":"JSC"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Huet, G\u00e9rard and Oppen, Derek, C., ?Equations and rewrite rules: A survey?, in R. Book (Ed.),Formal Languages ? Perspectives and Open Problems, pp. 349?405. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"CR5","unstructured":"Jouannaud, Jean-Pierre, Lescanne, Pierre and Reinig, Fernand, ?Recursive decomposition ordering?, in D. Bj\u00f8rner (Ed.),Working Conference on Formal Description of Programming Concepts II (IFIP), pp. 331?348, Garmisch-Partenkirchen (Germany), 1982."},{"key":"CR6","unstructured":"Kamin, Sam and L\u00e9vy, Jean-Jacques, ?Attempts for generalizing the recursive path orderings?, Urbana (Illinois), February 1980."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Kapur, Deepak, Narendran, Paliath and Sivakumar, G., ?A path ordering for proving termination of term rewriting systems?, InProc. 10th CAAP (LNCS 185), pp. 173?187, Berlin (Germany), March 1985.","DOI":"10.1007\/3-540-15198-2_11"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Knuth, Donald E. and Bendix, Peter B., ?Simple word problems in universal algebras?, in J. Leech (Ed.),Computational Problems in Abstract Algebra, pp. 263?297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(85)90175-6","volume":"40","author":"M. S. Krishnamoorthy","year":"1985","unstructured":"Krishnamoorthy, M. S. and Narendran, Paliath, ?Note on recursive path ordering?,J. TCS,40, 323?328 (1985).","journal-title":"J. TCS"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00302640","volume":"6","author":"Pierre Lescanne","year":"1990","unstructured":"Lescanne, Pierre, ?On the recursive decomposition ordering with lexicographical status and other related orderings?,JAR,6, 39?49 (1990).","journal-title":"JAR"},{"key":"CR11","volume-title":"A recursively defined ordering for proving the termination of term rewriting systems","author":"David Alan Plaisted","year":"1978","unstructured":"Plaisted, David Alan, ?A recursively defined ordering for proving the termination of term rewriting systems?, internal report UIUCDCS-R-87-943, University of Illinois at Urbana-Champaign, Urbana (Illinois), September 1978."},{"key":"CR12","first-page":"117","volume":"3","author":"Micha\u00ebl Rusinowitch","year":"1987","unstructured":"Rusinowitch, Micha\u00ebl, ?Path of subterms ordering and recursive decomposition ordering revisited,JSC,3, 117?131 (1987).","journal-title":"JSC"},{"key":"CR13","unstructured":"Steinbach, Joachim, ?Extensions and comparison of simplification orderings?, in N. Dershowitz (Ed.),Proc. 3rd RTA (LNCS 355), pp. 434?448, Chapel Hill (North Carolina), April 1989."},{"key":"CR14","series-title":"SEKI-Report","volume-title":"On the complexity of simplification orderings","author":"Joachim Steinbach","year":"1993","unstructured":"Steinbach, Joachim, ?On the complexity of simplification orderings?,SEKI-Report, University of Kaiserslautern, Kaiserslautern (Germany), 1993."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881798.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881798\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:53:58Z","timestamp":1586044438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00881798"],"URL":"https:\/\/doi.org\/10.1007\/bf00881798","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}