{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T04:59:57Z","timestamp":1698037197844},"reference-count":17,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":7211,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1987,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A fast algorithm for performing simplification and matching is described. The algorithm gives an improvement of up to an order of magnitude on suitable problems. It makes use of a dag data structure and tag fields to avoid redundant matches. Performance studies were done to determine the relative importance of various features in improving the running time.<\/jats:p>","DOI":"10.1002\/spe.4380170203","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T02:07:52Z","timestamp":1163815672000},"page":"105-115","source":"Crossref","is-referenced-by-count":1,"title":["Tree matching and simplification"],"prefix":"10.1002","volume":"17","author":[{"suffix":"Jr.","given":"Paul Walton","family":"Purdom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia A.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.2307\/2266325"},{"key":"e_1_2_1_3_3","volume-title":"Computability and Unsolvability","author":"Davis Martin","year":"1958"},{"key":"e_1_2_1_4_2","unstructured":"Paul W.Purdom Jr.andCynthia A.Brown \u2018Tree matching and simplification\u2019 Tech. Report181 Computer Science Dept. Indiana University 1985."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/27.2.97"},{"key":"e_1_2_1_6_2","first-page":"215","volume-title":"Equational Logic as a Programming Language","author":"O'Donnell Michael J.","year":"1985"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"PaulChew \u2018An improved algorithm for computing with equations\u2019 21st Annual Symposium on Foundations of Computer Science 1980 pp.108\u2013117.","DOI":"10.1109\/SFCS.1980.11"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322228"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322198"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-15976-2_9"},{"key":"e_1_2_1_11_2","unstructured":"J.GallierandR. V.Book \u2018Reductions in tree replacement systems\u2019 unpublished manuscript;"},{"key":"e_1_2_1_11_3","series-title":"Proceedings of an NSF Workshop on the Rewrite Rule Laboratory","first-page":"39","volume-title":"Experiments with and architecture of RRL, a rewrite rule laboratory","author":"Kapur D.","year":"1984"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-15976-2_21"},{"key":"e_1_2_1_13_2","unstructured":"Jean MarieHullot \u2018Compilation de formes canoniques dans des th\u00e9ories \u00e9quationnelles\u2019 Thesis l'Universit\u00e9 de Paris\u2010Sud 1980."},{"key":"e_1_2_1_14_2","first-page":"33","volume-title":"Proceedings of an NSF Workshop on the Rewrite Rule Laboratory","author":"Kapur Deepak","year":"1984"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1980.230459"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380170203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380170203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T10:11:47Z","timestamp":1697969507000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380170203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["10.1002\/spe.4380170203"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380170203","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}