Contents of the Proceedings of the
0th International Conference on Rewriting Techniques and Applications.
Tsukuba, Japan, March 30 - April 1, 1998.
Lecture Notes in Computer Science, Vol. 1379, Springer Verlag.
Editor: Tobias Nipkow.
- J. W. Klop,
Origin Tracking in Term Rewriting (Abstract)
(page 1).
- S. Okui,
Simultaneous Critical Pairs and Church-Rosser Property
(pages 2-16).
- E. Ohlebusch,
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence
Relation
(pages 17-31).
- F. Otto, A. Sattler-Klein and K. Madlener,
Automatic Monoids Versus Monoids with Finite Convergent
Presentations
(pages 32-46).
- J. Levy,
Decidable and Undecidable Second-Order Unification Problems
(pages 47-60).
- M. Schmidt-Schauß and K. U. Schulz,
On the Exponent of Periodicity of Minimal Solutions of Context
Equation
(pages 61-75).
- F. Jacquemard, C. Meyer and C. Weidenbach,
Unification in Extension of Shallow Equational Theories
(pages 76-90).
- Q. Guo, P. Narendran and S. K. Shukla,
Unification and Matching in Process Algebras
(pages 91-105).
- R. A. Schmidt,
E-Unification for Subsystems of S4
(pages 106-120).
- S. Limet and P. Réty,
Solving Disequations Modulo Some Class of Rewrite Systems
(pages 121-135).
- H. Comon,
About Proofs by Consistency (Abstract)
(pages 136-137).
- J. Waldmann,
Normalization of S-Terms is Decidable
(pages 138-150).
- T. Genet,
Decidable Approximations of Sets of Descendants and Sets of Normal
Forms
(pages 151-165).
- R. M. Verma, M. Rusinowitch and D. Lugiez,
Algorithms and Reductions for Rewriting Problems
(pages 166-180).
- A. Degtyarev, Y. Gurevich, P. Narendran, M. Veanes and A. Voronkov,
The Decidability of Simultaneous Rigid E-Unification with One
Variable
(pages 181-195).
- M. Müller and J. Niehren,
Ordering Constraints over Feature Trees Expressed in Second-Order
Monadic Logic
(pages 196-210).
- W. Charatonik and A. Podelski,
Co-definite Set Constraints
(pages 211-225).
- T. Arts and J. Giesl,
Modularity of Termination Using Dependency pairs
(pages 226-240).
- C. Marché and X. Urbain,
Termination of Associative-Commutative Rewriting by Dependency
Pairs
(pages 241-255).
- T. Aoto and Y. Toyama,
Termination Transformation by Tree Lifting Ordering
(pages 256-270).
- H. Xi,
Towards Automated Termination Proofs through "Freezing"
(pages 271-285).
- O. Danvy and K. H. Rose,
Higher-Order Rewriting and Partial Evaluation
(pages 286-301).
- Y. Akama,
SN Combinators and Partial Combinatory Algebras
(pages 302-316).
- D. Fuchs,
Coupling Saturation-Based Provers by Exchanging Positive/Negative
Information
(pages 317-331).
- N. Dershowitz and R. Treinen,
An On-line Problem Database
(pages 332-342).