Skip to main content
SpringerLink
Log in
Book cover

Rewriting Techniques and Applications

8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Hubert Comon
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1232)

Included in the following conference series:

Conference proceedings info: RTA 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Well-behaved search and the Robbins problem

    • William McCune
    Pages 1-7

  3. Goal-Directed Completion using SOUR Graphs

    • Christopher Lynch
    Pages 8-22

  4. Shostak's congruence closure as completion

    • Deepak Kapur
    Pages 23-37

  5. Conditional equational specifications of data types with partial operations for inductive theorem proving

    • Ulrich Kühler, Claus-Peter Wirth
    Pages 38-52

  6. Cross-sections for finitely presented monoids with decidable word problems

    • Friedrich Otto, Masashi Katsura, Yuji Kobayashi
    Pages 53-67

  7. New undecidability results for finitely presented monoids

    • Andrea Sattler-Klein
    Pages 68-82

  8. On the property of preserving regularity for string-rewriting systems

    • Friedrich Otto
    Pages 83-97

  9. Rewrite systems for natural, integral, and rational arithmetic

    • Evelyne Contejean, Claude Marché, Landy Rabehasaina
    Pages 98-112

  10. D-bases for polynomial ideals over commutative noetherian rings

    • Leo Bachmair, Ashish Tiwari
    Pages 113-127

  11. On the word problem for free lattices

    • Georg Struth
    Pages 128-141

  12. A total, ground path ordering for proving termination of AC-rewrite systems

    • Deepak Kapur, G. Sivakumar
    Pages 142-156

  13. Proving innermost normalisation automatically

    • Thomas Arts, Jürgen Giesl
    Pages 157-171

  14. Termination of context-sensitive rewriting

    • H. Zantema
    Pages 172-186

  15. A new parallel closed condition for Church-Rosser of left-linear term rewriting systems

    • Michio Oyamaguchi, Yoshikatsu Ohta
    Pages 187-201

  16. Innocuous constructor-sharing combinations

    • Nachum Dershowitz
    Pages 202-216

  17. Scott's conjecture is true, position sensitive weights

    • Samuel M. H. W. Perlo-Freeman, Péter Prőhle
    Pages 217-227

  18. Two-dimensional rewriting

    • Yves Lafont
    Pages 228-229

  19. A complete axiomatisation for the inclusion of series-parallel partial orders

    • Denis Bechet, Philippe de Groote, Christian Retoré
    Pages 230-240

  20. Undecidability of the first order theory of one-step right ground rewriting

    • Jerzy Marcinkowski
    Pages 241-253
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation