Advertisement

Symbolic Rewriting Techniques

  • Manuel Bronstein
  • Volker Weispfenning
  • Johannes Grabmeier

Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 15)

Table of contents

  1. Front Matter
    Pages i-vii
  2. Beatrice Amrhein, Reinhard Bündgen, Wolfgang Küchlin
    Pages 1-34
  3. Reinhard Bündgen
    Pages 47-70
  4. E. D. Green, Teo Mora, Victor Ufnarovski
    Pages 93-104
  5. Daniel Mall
    Pages 181-191
  6. Attila Pethö, Joachim Stein, Thomas Weis, Horst G. Zimmer
    Pages 245-265

About these proceedings

Introduction

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.

Keywords

Computer algebra algebra commutatitve algebra equation group theory ring theory

Editors and affiliations

  • Manuel Bronstein
    • 1
  • Volker Weispfenning
    • 2
  • Johannes Grabmeier
    • 3
  1. 1.INRIAFrance
  2. 2.FMI Universität PassauGermany
  3. 3.IBM Deutschland Informationssysteme GmbHGermany

Bibliographic information