Rewriting Techniques and Applications: 8th International Conference, RTA-97 Sitges, Spain, June 2–5, 1997 Proceedings

William McCune (auth.), Hubert Comon (eds.)3540629505, 9783540629504

This book constitutes the refereed proceedings of the 8th International Conference on Rewriting Techniques and Applications, RTA-97, held in Sitges, Spain, in June 1997.
The 24 revised full papers presented were selected from a total of 54 submissions. Also included are abstracts of two invited talks and four system descriptions. Besides classical topics like termination, confluence, or applications to theorem proving, several new approaches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications.

---

Table of contents :
Well-behaved search and the Robbins problem….Pages 1-7
Goal-Directed Completion using SOUR Graphs….Pages 8-22
Shostak’s congruence closure as completion….Pages 23-37
Conditional equational specifications of data types with partial operations for inductive theorem proving….Pages 38-52
Cross-sections for finitely presented monoids with decidable word problems….Pages 53-67
New undecidability results for finitely presented monoids….Pages 68-82
On the property of preserving regularity for string-rewriting systems….Pages 83-97
Rewrite systems for natural, integral, and rational arithmetic….Pages 98-112
D-bases for polynomial ideals over commutative noetherian rings….Pages 113-127
On the word problem for free lattices….Pages 128-141
A total, ground path ordering for proving termination of AC-rewrite systems….Pages 142-156
Proving innermost normalisation automatically….Pages 157-171
Termination of context-sensitive rewriting….Pages 172-186
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems….Pages 187-201
Innocuous constructor-sharing combinations….Pages 202-216
Scott’s conjecture is true, position sensitive weights….Pages 217-227
Two-dimensional rewriting….Pages 228-229
A complete axiomatisation for the inclusion of series-parallel partial orders….Pages 230-240
Undecidability of the first order theory of one-step right ground rewriting….Pages 241-253
The first-order theory of one step rewriting in linear noetherian systems is undecidable….Pages 254-268
Solving linear Diophantine equations using the geometric structure of the solution space….Pages 269-283
A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms….Pages 284-298
Effective reduction and conversion strategies for combinators….Pages 299-307
Finite family developments….Pages 308-322
Prototyping combination of unification algorithms with the ELAN rule-based programming language….Pages 323-326
The invariant package of MAS….Pages 327-330
Opal: A system for computing noncommutative gröbner bases….Pages 331-334
TRAM: An abstract machine for order-sorted conditional term rewriting systems….Pages 335-338