Symbolic rewriting techniques
Author(s)
Bibliographic Information
Symbolic rewriting techniques
（Progress in computer science and applied logic, v. 15）
Birkhäuser Verlag, c1998
- : Basel : alk. paper
- Boston : pbk. : alk. paper
Available at / 18 libraries
-
Digital Library of Nara Institute of Science and Technology
: Basel : alk. paperBD40||119107948
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
"This volume contains ... the Symbolic Rewriting Techniques workshop, which was held in the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995" -- Pref
Description and Table of Contents
Description
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 Techniques" workshop held at the Centro Stefano Franscini in Ascona, Switzerland from April 30th to May 4th, 1995. The workshop brought together 40 reseachers 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.
Table of Contents
- Parallel completion techniques, B. Amrhein et al
- the computation of Grobner bases using an alternative algorithm, J. Apel
- symmetrization based completion, R. Bundgen
- on the reduction of G-invariant polynomials for an arbitrary permutation groups G, M. Gobel
- the non-commutative Grobner freaks, E. Green et al
- alternatives in implementing noncommutative grobner basis systems, B. Keller
- a general approach to monoid and group rings, K. Madlener et al
- Grobner fans and projective schemes, D. Mall
- normalized rewriting - a unified view of Knut-Bendix completion and Grobner bases computation, C. Marche
- new directions for syntactic termination orderings, U. Martin
- two-sided Grobner bases in iterated ore extensions, M. Petho
- computing the torsion group of elliptic curves by the method of Grobner bases, a. Petho et al
- finding a finite group presentation using rewriting, P. Strogova
- deciding degree-four-identities for alternative rings by rewriting, A. Widiger.
by "Nielsen BookData"
