{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T22:23:39Z","timestamp":1593469419504},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1993,1,2]]},"DOI":"10.1145\/138027.138032","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:13Z","timestamp":1027769173000},"page":"1-16","source":"Crossref","is-referenced-by-count":20,"title":["An algorithm for finding canonical sets of ground rewrite rules in polynomial time"],"prefix":"10.1145","volume":"40","author":[{"given":"Jean","family":"Gallier","sequence":"first","affiliation":[{"name":"Univ. of Pennsylvania, Philadelphia"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[{"name":"State Univ. of New York, Albany"}]},{"given":"David","family":"Plaisted","sequence":"additional","affiliation":[{"name":"Univ. of North Carolina, Chapel Hill"}]},{"given":"Stan","family":"Raatz","sequence":"additional","affiliation":[{"name":"Rutgers Univ., New Brunswick, NJ"}]},{"given":"Wayne","family":"Snyder","sequence":"additional","affiliation":[{"name":"Boston Univ., Boston, MA"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_2","DOI":"10.1145\/322248.322249","doi-asserted-by":"publisher"},{"key":"e_1_2_1_2_2","unstructured":"Ill. Ill. L. ~BACHMAIR Proof methods for equational theories. Ph.D dissertation Univ. Illinois ~Urbana-Champaign 1987 10.5555\/37548"},{"key":"e_1_2_1_3_2","author":"~BACHMAIR L.","first-page":"1","year":"1989","volume-title":"Resoh~- ~non of Equations in Algebraic Structures"},{"key":"e_1_2_1_4_2","author":"~B EL, W","volume":"8","first-page":"31","year":"1979","journal-title":"Theoret. Comput. ~Sci.","DOI":"10.1016\/0304-3975(79)90054-9","doi-asserted-by":"crossref"},{"key":"e_1_2_1_5_2","DOI":"10.1145\/322276.322277","doi-asserted-by":"publisher"},{"key":"e_1_2_1_6_2","unstructured":"~BmEL W. Automated Theorem Prot ing. Friedr. Vieweg & Sohn Braunschweig Germany ~1982. ~BmEL W. Automated Theorem Prot ing. Friedr. Vieweg & Sohn Braunschweig Germany ~1982."},{"key":"e_1_2_1_7_2","unstructured":"Proceedings of the LICS'87 (Ithaca N.Y.). IEEE New ~York Proceedings of the LICS'87 (Ithaca N.Y.). IEEE New ~York M. ~DAUCHET S. SON LARD HEU P. LESCANNE Decidability of the confluence ~of ground term rewriting systems 1987 353 359"},{"key":"e_1_2_1_8_2","DOI":"10.1016\/S0747-7171(87)80022-6","doi-asserted-by":"publisher"},{"key":"e_1_2_1_9_2","author":"~DERSHOWITZ N.","first-page":"31","year":"1989","volume-title":"Resolution of Equations in Algebraic ~Structures"},{"key":"e_1_2_1_10_2","DOI":"10.1145\/322217.322228","doi-asserted-by":"publisher"},{"key":"e_1_2_1_11_2","unstructured":"New York New York J. H. ~GALLIER Logic for Computer Science: Foundations of Automatic Theorem ProL ing. ~Harper and Row 1986 10.5555\/4691"},{"key":"e_1_2_1_12_2","unstructured":"Proceedings of the L1CS'87 (Ithaca N.Y.). IEEE New York Proceedings of the L1CS'87 (Ithaca N.Y.). IEEE J. H. ~GALLIER S. RAATZ W. SNYDER Theorem proving using rigid E-unification: ~Equational matings 1987 338 346"},{"key":"e_1_2_1_13_2","unstructured":"Proceedings of the LICS'88 Edinburgh Scotland July 5-8). IEEE New ~York Proceedings of the LICS'88 R J ~GALL P. NARENDRAN D. PLAISTED W. SNYDER Rigid E-unification is ~NP-complete 1988 218 227"},{"key":"e_1_2_1_14_2","author":"~GALLIER J. H.","first-page":"151","year":"1989","volume-title":"ResolWton of Equattons in Algebraic Stnlctures"},{"key":"e_1_2_1_15_2","unstructured":"~GALLIER J. H. NARENDRAN P. PLAISTED D. AND SNYDER W. Rigid E-unification: ~NP-completeness and applications to theorem proving bzf. Comput. 87 1\/2 (special issue) ~(1990) pp. 129-195. 10.1016\/0890-5401(90)90061-L ~GALLIER J. H. NARENDRAN P. PLAISTED D. AND SNYDER W. Rigid E-unification: ~NP-completeness and applications to theorem proving bzf. Comput. 87 1\/2 (special issue) ~(1990) pp. 129-195. 10.1016\/0890-5401(90)90061-L"},{"key":"e_1_2_1_16_2","unstructured":"~GALt.mR J. H. NARENDRAN P. RAATZ S. AND SNYDER W. Theorem proving using ~equational matings and rigid E-unification. J. ACM 30. 2 (Apr. 1992). 377-429. 10.1145\/128749.128754 ~GALt.mR J. H. NARENDRAN P. RAATZ S. AND SNYDER W. Theorem proving using ~equational matings and rigid E-unification. J. ACM 30. 2 (Apr. 1992). 377-429. 10.1145\/128749.128754"},{"key":"e_1_2_1_17_2","DOI":"10.1145\/322217.322230","doi-asserted-by":"publisher"},{"key":"e_1_2_1_18_2","author":"~HUET G.","year":"1982","volume-title":"Formal Languages: ~Perspectwes and Open Problems"},{"key":"e_1_2_1_19_2","author":"~KAPUR D.","volume":"35","first-page":"337","year":"1985","journal-title":"Theoret. Compt~t. Sct.","DOI":"10.1016\/0304-3975(85)90023-4","doi-asserted-by":"crossref"},{"key":"e_1_2_1_20_2","author":"~KNUTH D.","year":"1970","volume-title":"Cor~Tputa- ~tional Problems in .4bstractAlgebra"},{"key":"e_1_2_1_22_2","unstructured":"Proceedings of the 9th 4nnual ~Symposium on Theoly of Compzltzng (Boulder Colo. May). ACM New York Proceedings of the 9th 4nnual ~Symposium on Theoly of Compzltzng (Boulder Colo. May). ACM D. KOZEN Complexity of finitely presented algebras 1977 64 177 10.1145\/800105.803406 10.1145\/800105.803406 10.1145\/800105.803406"},{"key":"e_1_2_1_23_2","author":"~KRISHNAMOORTHY M. S.","volume":"40","first-page":"323","year":"1985","journal-title":"Scl."},{"key":"e_1_2_1_24_2","unstructured":"~LANKFORD D.S. Canonical inference. Rep. ATP-32. Univ. Texas Houston Tex. 1975. ~LANKFORD D.S. Canonical inference. Rep. ATP-32. Univ. Texas Houston Tex. 1975."},{"key":"e_1_2_1_25_2","DOI":"10.1145\/322186.322198","doi-asserted-by":"publisher"},{"key":"e_1_2_1_26_2","unstructured":"~OTTO F. AND SQUIER C. The word problem for finitely presented monoids and finite ~pp. 74-82. ~OTTO F. AND SQUIER C. The word problem for finitely presented monoids and finite ~pp. 74-82."}],"container-title":["Journal of the ACM (JACM)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=138032&ftid=42984&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,16]],"date-time":"2020-02-16T16:56:34Z","timestamp":1581872194000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1,2]]},"references-count":25,"journal-issue":{"published-print":{"date-parts":[[1993,1,2]]},"issue":"1"},"alternative-id":["10.1145\/138027.138032"],"URL":"http:\/\/dx.doi.org\/10.1145\/138027.138032","relation":{"cites":[]},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Control and Systems Engineering","Hardware and Architecture","Software","Artificial Intelligence","Information Systems"]}}