Termination of rewriting systems by polynomial interpretations and its implementation

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Gérard Huet · Journal of the ACM · 1980 · 1.1K citations · Full text

Language Studies, Information Systems, Computational Linguistics +7

Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Gary S. Collins · Medical Entomology and Zoology · 1975 · 902 citations

Natural Sciences, Computer Science, Mathematics +9

Orderings for term-rewriting systems

Nachum Dershowitz · Theoretical Computer Science · 1982 · 607 citations

Computing, Computer Science, Algorithms +6

Computational Problems in Abstract Algebra

Harold Chapman Brown, John Leech · Mathematics of Computation · 1971 · 593 citations

Natural Sciences, Computer Science, Mathematics +6

Complete Sets of Reductions for Some Equational Theories

Gerald E. Peterson, Mark E. Stickel · Journal of the ACM · 1981 · 413 citations · Full text

Natural Sciences, Mathematics, Discrete Mathematics +7