Title	Symbolic Rewriting Techniques [electronic resource] / edited by Manuel Bronstein, Volker Weispfenning, Johannes Grabmeier
Imprint	Basel : Birkhรคuser Basel : Imprint: Birkhรคuser, 1998
Connect to	http://dx.doi.org/10.1007/978-3-0348-8800-4
Descript	VII, 288 p. online resource

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 Grรถbner 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

Parallel Completion Techniques -- The Computation of Grรถbner Bases Using an Alternative Algorithm -- Symmetrization Based Completion -- On the Reduction of G-invariant Polynomials for an Arbitrary Permutation Groups G -- The Non-Commutaive Grรถbner Freaks -- Alternatives in Implementing Noncommutative Grรถbner Basis Systems -- String Rewriting and Grรถbner Bases โ A General Approach to Monoid and Group Rings -- Grรถbner Fans and Projective Schemes -- Normalized Rewriting: A Unified View of Knuth-Bendix Completion and Grรถbner Bases Computation -- New Directions for Syntactic Termination Orderings -- Two-sided Grรถbner Bases in Iterated Ore Extensions -- Computing the Torsion Group of Elliptic Curves by the Method of Grรถbner Bases -- Finding a Finite Group presentation Using Rewriting -- Deciding Degree-Four-Identities for Alternative Rings by Rewriting

1. Computer science
2. Computers
3. Mathematics
4. Computer Science
5. Theory of Computation
6. Mathematics
7. general