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 Groebner 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 Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.

First edition received rave reviews

The second edition offers a new chapter on parallel integration

Includes additional exercises

Symbolic Integration I is destined to become the standard reference work in the field. Manuel Bronstein is a leading expert on this topic and his book is the first to treat the subject both comprehensively and in sufficient detail - incorporating new results along the way. The book addresses mathematicians and computer scientists interested in symbolic computation, developers and programmers of computer algebra systems as well as users of symbolic integration methods. Many algorithms are given in pseudocode ready for immediate implementation, making the book equally suitable as a textbook for lecture courses on symbolic integration.

This second edition offers a new chapter on parallel integration, a number of other improvements and a couple of additional exercises.

From the reviews of the first edition: ..". The writing is excellent, and the author provides a clear and coherent treatment of the problem of symbolic integration of transcendental functions " F. Winkler, Computing Reviews 1997 "

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: a the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, a the Buchberger algorithm for GrAbner bases, a the Ritt-Wu characteristic set method for ordinary differential equations, and a the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.