Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: the Knuth-Bendix completion for groups, monoids and general term-rewriting systems; the Buchberger algorithm for Grobner bases; the Ritt-Wu characteristic set method for ordinary differential equations; and the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the "Symbolic Rewriting...