Flatterms, discrimination nets, and fast term rewriting
- 1 January 1993
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 10 (1) , 95-113
- https://doi.org/10.1007/bf00881866
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast Knuth-Bendix completion with a term rewriting system compilerInformation Processing Letters, 1989
- The Path-Indexing Method for Indexing TermsPublished by Defense Technical Information Center (DTIC) ,1989
- Adventures in associative-commutative unificationJournal of Symbolic Computation, 1989
- A compiler for a class of conditional term rewriting systemsPublished by Springer Nature ,1988
- Architecture for conditional term rewritingPublished by Springer Nature ,1988
- Compiling conditional rewriting systemsPublished by Springer Nature ,1988
- A compiler for conditional term rewriting systemsPublished by Springer Nature ,1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Ternary Boolean algebraBulletin of the American Mathematical Society, 1947