{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:06:19Z","timestamp":1749125179350},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566106"},{"type":"electronic","value":"9783540475989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56610-4_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:23:04Z","timestamp":1330255384000},"page":"61-74","source":"Crossref","is-referenced-by-count":26,"title":["Associative-commutative discrimination nets"],"prefix":"10.1007","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[]},{"given":"Ta","family":"Chen","sequence":"additional","affiliation":[]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"J. Christian. Fast Knuth-Bendix completion: Summary. In RTA'89, pages 551\u2013555. Springer-Verlag LNCS 355, 1989.","key":"5_CR1","DOI":"10.1007\/3-540-51081-8_136"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D. Kapur","year":"1987","unstructured":"D. Kapur D. Benanav and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3:203\u2013216, 1987.","journal-title":"Journal of Symbolic Computation"},{"doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243\u2013309. Elsevier, 1990.","key":"5_CR3","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"5_CR4","first-page":"323","volume":"488","author":"A. Graf","year":"1991","unstructured":"A. Graf. Left-to-right tree pattern matching. In RTA '91, pages 323\u2013334. Springer-Verlag LNCS 488, 1991.","journal-title":"Springer-Verlag LNCS"},{"doi-asserted-by":"crossref","unstructured":"J.-M. Hullot. A catalogue of canonical term rewriting systems. Technical Report CSL-113, SRI International, April 1980.","key":"5_CR5","DOI":"10.21236\/ADA087641"},{"doi-asserted-by":"crossref","unstructured":"E. Kounalis and D. Lugiez. Compilation of pattern matching with associativecommutative functions. In TAPSOFT'91, pages 57\u201373. Springer-Verlag LNCS 493, 1991.","key":"5_CR6","DOI":"10.1007\/3-540-53982-4_4"},{"unstructured":"D. Lugiez and J.L. Moysset. Complement problems and tree automata in AC-like theories. To appear in STACS'93.","key":"5_CR7"},{"key":"5_CR8","volume-title":"Technical Report MCS-P191-1190","author":"W. McCune","year":"1991","unstructured":"W. McCune. Experiments with discrimination-tree indexing and path indexing for term retrieval. Technical Report MCS-P191-1190, Argonne National Laboratory, Argonne, Illinois, USA, January 1991."},{"key":"5_CR9","volume-title":"Technical report","author":"D. Nicolaita","year":"1992","unstructured":"D. Nicolaita. An indexing scheme for AC-equational theories. Technical report, Research Institute for Infomatics, Bucharest, Romania, February 1992."},{"doi-asserted-by":"crossref","unstructured":"R. Ramesh, I.V. Ramakrishnan, and D.S. Warren. Automata-driven indexing of prolog clauses. In Seventh Annual ACM Symposium on Principles of Programming Languages, pages 281\u2013290, San Francisco, 1990.","key":"5_CR10","DOI":"10.1145\/96709.96738"},{"key":"5_CR11","first-page":"247","volume":"623","author":"R. C. Sekar","year":"1992","unstructured":"R.C. Sekar, R. Ramesh, and I.V. Ramakrishnan. Adaptive pattern matching. In ICALP'92, pages 247\u2013260. Springer-Verlag LNCS 623, 1992.","journal-title":"Springer-Verlag LNCS"},{"key":"5_CR12","volume-title":"Technical Report 473","author":"M. E. Stickel","year":"1989","unstructured":"M. E. Stickel. The path-indexing method for indexing terms. Technical Report 473, SRI International, Menlo Park, California, USA, October 1989."},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0890-5401(92)90075-Q","volume":"101","author":"R. M. Verma","year":"1992","unstructured":"R. M. Verma and I.V. Ramakrishnan. Tight complexity bounds for term matching problems. Information and Computation, 101(1):33\u201369, November 1992.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT'93: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56610-4_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:56Z","timestamp":1605647096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56610-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566106","9783540475989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56610-4_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}