{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:36Z","timestamp":1725663276728},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159766"},{"type":"electronic","value":"9783540396796"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15976-2_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:25:15Z","timestamp":1330194315000},"page":"241-254","source":"Crossref","is-referenced-by-count":15,"title":["Associative path orderings"],"prefix":"10.1007","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"11_CR1","unstructured":"L. Bachmair, Termination orderings for associative commutative rewriting systems, Report UIUCDCS-R-84-1179, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, December 1984."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0020-0190(79)90071-1","volume":"9","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz, A note on simplification orderings. Information Processing Letters 9 (1979), 212\u2013215.","journal-title":"Information Processing Letters"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science 17 (1982), 279\u2013301.","journal-title":"Theoretical Computer Science"},{"key":"11_CR4","unstructured":"N. Dershowitz, J. Hsiang, N.A. Josephson and D.A. Plaisted, Associative-commutative rewriting. Proc. 8th IJCAI, Karlsruhe, 1983, 990\u2013994."},{"key":"11_CR5","unstructured":"J. Hsiang, Topics in automated theorem proving and program generation, Ph. D. thesis, Univ. of Illinois at Urbana-Champaign, 1983."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27 (1980), 797\u2013821.","journal-title":"J. ACM"},{"key":"11_CR7","first-page":"349","volume-title":"Formal languages: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D.C. Oppen, Equations and rewrite rules: a survey. Formal languages: Perspectives and Open Problems (R. Book, ed.), New York: Academic Press, 1980, 349\u2013405."},{"key":"11_CR8","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA087641","volume-title":"A catalogue of canonical term rewriting systems","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot, A catalogue of canonical term rewriting systems, Technical Report CSL-113, SRI International, Menlo Park, Calif., April 1980."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud and H. Kirchner, Completion of a set of rules modulo a set of equations, 11th Ann. ACM Symp. on Principles of Programming Languages, Salt Lake City, Utah, 1984, 83\u201392.","DOI":"10.1145\/800017.800519"},{"key":"11_CR10","series-title":"Lecture Notes in Comp. Scie.","first-page":"175","volume-title":"Proc. 7th Int. Conf. on Automated Deduction","author":"J.-P. Jouannaud","year":"1984","unstructured":"J.-P. Jouannaud and M. Munoz, Termination of a set of rules modulo a set of equations, Proc. 7th Int. Conf. on Automated Deduction (R. Shostak, ed.). Lecture Notes in Comp. Scie. 170, Berlin: Springer Verlag, 1984, 175\u2013193."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"D. Knuth and P. Bendix, Simple word problems in universal algebras. Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press, 1970, 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"11_CR12","unstructured":"D. Lankford and A. Ballantyne, Decision procedures for simple equational theories with associative commutative axioms: complete sets of associative commutative reductions. Technical Report, Univ. of Texas at Austin, Dept. of Math. and Comp. Scie., 1977."},{"key":"11_CR13","unstructured":"M. Munoz, Probleme de terminaison finie des systemes de reecriture equationnels. Ph. D. thesis, Universite Nancy 1, 1983."},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. E. Peterson","year":"1981","unstructured":"G.E. Peterson and M.E. Stickel, Complete sets of reductions for some equational theories, J. ACM 28 (1981), 233\u2013264.","journal-title":"J. ACM"},{"key":"11_CR15","unstructured":"D.A. Plaisted, An associative path ordering, Proc. NSF Workshop on the Rewrite Rule Laboratory, Report 84GEN008, General Electric, Schenectady, New York, April 1984, 123\u2013136."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15976-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:01Z","timestamp":1605643741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15976-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159766","9783540396796"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-15976-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}