{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:45Z","timestamp":1761611145750},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","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\/bf00881866","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T07:34:31Z","timestamp":1104132871000},"page":"95-113","source":"Crossref","is-referenced-by-count":49,"title":["Flatterms, discrimination nets, and fast term rewriting"],"prefix":"10.1007","volume":"10","author":[{"given":"Jim","family":"Christian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Boyer, Bob, ?Rewrite rule compilation?, Technical Report AI-194-86-P, Micro-electronics and Computer Technology Corporation (MCC) (June 1986)."},{"key":"CR2","unstructured":"Christian, Jim, ?High-performance permutative completion?, Ph.D. thesis, University of Texas at Austin (1989). Available as MCC Technical Report ACT-AI-303-89."},{"key":"CR3","unstructured":"Christian, Jim, ?Fast Knuth-Bendix completion: Summary?, inProceedings of the Conference on Rewriting Techniques and Applications, Chapel Hill, North Carolina (1989)."},{"key":"CR4","volume-title":"Computational Problems in Abstract Algebra","author":"Donald Knuth","year":"1970","unstructured":"Knuth, Donald, and Bendix, Peter, ?Simple word problems in universal algebra?, in J. Leech (ed.),Computational Problems in Abstract Algebra, Pergamon Press, Oxford, U.K. (1970)."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Geser, Alfons, Hussman, Heinrich, and M\u00fcck, Andreas, ?A compiler for a class of conditional term rewriting systems?, inProceedings of the 1st Intl. Workshop on Conditional Term Rewriting Systems, pp. 84?90, Orsay, France (1987).","DOI":"10.1007\/3-540-19242-5_7"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1090\/S0002-9904-1947-08834-0","volume":"53","author":"A. Grau","year":"1947","unstructured":"Grau, A., ?Ternary Boolean algebra?,Bull. Amer. Math. Soc.,53, 567?572 (1947).","journal-title":"Bull. Amer. Math. Soc."},{"key":"CR7","unstructured":"Greenbaum, Steven, ?Input transformations and resolution implementation techniques for theorem proving in first-order logic?, Ph.D. thesis, University of Illinois at Urbana-Champaign (1986)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Heuillard, Thierry, ?Compiling conditional rewriting systems?, inProceedings of the 1st Intl. Workshop on Conditional Term Rewriting Systems, pp. 111?128, Orsay, France (1987).","DOI":"10.1007\/3-540-19242-5_10"},{"key":"CR9","unstructured":"Hsiang, Jieh, and Rusinowitch, Michael, ?On word problems in equational theories?, Technical Report 86\/29, Dept. of Computer Science, SUNY Stonybrook (1986)."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Jouannaud, Jean-Pierre, and Kirchner, Helene, ?Completion of a set of rules modulo a set of equations?,SIAM. J. Computing (November 1986).","DOI":"10.1137\/0215084"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Kaplan, St\u00e9phane, ?A compiler for conditional term rewriting systems?, inProceedings of the Conference on Rewriting Techniques and Applications, pp. 25?41, Bordeaux, France (1987).","DOI":"10.1007\/3-540-17220-3_3"},{"key":"CR12","volume-title":"Searching and Sorting","author":"Donald Knuth","year":"1973","unstructured":"Knuth, Donald,Searching and Sorting, Addison-Wesley, Reading, Massachusetts (1973)."},{"key":"CR13","unstructured":"Lincoln, Pat, and Christian, Jim, ?Adventures in associative-commutative unification: A summary?, inProceedings of the Ninth International Conference on Automated Deduction, pp. 358?367, Argonne, Illinois (1988)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0747-7171(89)80026-4","volume":"8","author":"Pat Lincoln","year":"1989","unstructured":"Lincoln, Pat, and Christian, Jim, ?Adventures in associative-commutative unification?,J. Symbolic Computation,8, 217?240 (1989).","journal-title":"J. Symbolic Computation"},{"key":"CR15","unstructured":"McCune, Bill, ?Discrimination tree indexing and FPA\/path indexing for large sets of formulaes?. Notes from a presentation at the AAAI Symposium on Compilation and Representation in High Performance Theorem Proving, Stanford University (1989)."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Rush, Tony, and Coleman, Derek, ?Architecture for conditional term rewriting?, inProceedings of the 1st Intl. Workshop on Conditional Term Rewriting Systems, pp. 266?278, Orsay, France (1987).","DOI":"10.1007\/3-540-19242-5_24"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Stickel, Mark, ?The path-indexing method for indexing terms?, Draft (August 1989).","DOI":"10.21236\/ADA460990"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Toyama, Yoshihito, ?Fast Knuth-Bendix completion with a term rewriting system compiler?, Technical Report COMP88, Institute of Electronics, Information, and Communication Engineers (Tokyo) (February 1989).","DOI":"10.1016\/0020-0190(89)90026-4"},{"key":"CR19","unstructured":"Warren, David H. D., ?An abstract Prolog instruction set?, Technical Report 309, SRI, 1983."},{"key":"CR20","unstructured":"Zhang, Hantao, ?Avoiding unnecessary unifiers in AC completion?, presentation at the AAAI Symposium on Compilation and Representation in High Performance Theorem Proving, Stanford University (1989)."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881866.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881866\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:53:59Z","timestamp":1586044439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00881866"],"URL":"https:\/\/doi.org\/10.1007\/bf00881866","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}