Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Tobias Nipkow
    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 1379)

Included in the following conference series:

Conference proceedings info: RTA 1998.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (25 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Origin tracking in term rewriting

    • J. W. Klop
    Pages 1-1

  3. Simultaneous critical pairs and Church-Rosser property

    • Satoshi Okui
    Pages 2-16

  4. Church-Rosser theorems for abstract reduction modulo an equivalence relation

    • Enno Ohlebusch
    Pages 17-31

  5. Automatic monoids versus monoids with finite convergent presentations

    • Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
    Pages 32-46

  6. Decidable and undecidable second-order unification problems

    • Jordi Levy
    Pages 47-60

  7. On the exponent of periodicity of minimal solutions of context equations

    • Manfred Schmidt-Schauß, Klaus U. Schulz
    Pages 61-75

  8. Unification in extensions of shallow equational theories

    • Florent Jacquemard, Christoph Meyer, Christoph Weidenbach
    Pages 76-90

  9. Unification and matching in process algebras

    • Qing Guo, Paliath Narendran, Sandeep K. Shukla
    Pages 91-105

  10. E-unification for subsystems of S4

    • Renate A. Schmidt
    Pages 106-120

  11. Solving disequations modulo some class of rewrite systems

    • Sébastien Limet, Pierre Réty
    Pages 121-135

  12. About proofs by consistency

    • Hubert Comon
    Pages 136-137

  13. Normalization of S-terms is decidable

    • Johannes Waldmann
    Pages 138-150

  14. Decidable approximations of sets of descendants and sets of normal forms

    • Thomas Genet
    Pages 151-165

  15. Algorithms and reductions for rewriting problems

    • Rakesh M. Verma, Michael Rusinowitch, Denis Lugiez
    Pages 166-180

  16. The decidability of simultaneous rigid E-unification with one variable

    • Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
    Pages 181-195

  17. Ordering constraints over feature trees expressed in second-order monadic logic

    • Martin Müller, Joachim Niehren
    Pages 196-210

  18. Co-definite set constraints

    • Witold Charatonik, Andreas Podelski
    Pages 211-225

  19. Modularity of termination using dependency pairs

    • Thomas Arts, Jürgen Giesl
    Pages 226-240

  20. Termination of associative-commutative rewriting by dependency pairs

    • Claude Marché, Xavier Urbain
    Pages 241-255
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with the assistance of 113 additional referees. The book covers all current aspects of rewriting including rewriting systems, term rewriting, string rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation