language: en

REWRITING METHODS FOR WORD PROBLEMS

NACHUM DERSHOWITZ
Department of Computer Science, University of Illinois at Urbana-Champaign,
1304 West Springfield Ave., Urbana, IL 61801-2987, U.S.A.

Abstract This paper outlines various recent approaches to solving word problems. Term orderings are used to define a terminating rewrite relation. When confluent, that relation defines unique normal forms that can be used to decide word problems. Some results obtained by these methods are summarized.

1. Introduction