9. RTA 1998: Tsukuba, Japan

@proceedings{DBLP:conf/rta/1998,
  editor    = {Tobias Nipkow},
  title     = {Rewriting Techniques and Applications, 9th International Conference,
               RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings},
  booktitle = {RTA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1379},
  year      = {1998},
  isbn      = {3-540-64301-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jan Willem Klop:
  Origin Tracking in Term Rewriting (Abstract). 1
  Electronic Edition (Springer LINK) BibTeX
• Satoshi Okui:
  Simultaneous Critical Pairs and Church-Rosser Property. 2-16
  Electronic Edition (Springer LINK) BibTeX
• Enno Ohlebusch:
  Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. 17-31
  Electronic Edition (Springer LINK) BibTeX
• Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener:
  Automatic Monoids Versus Monoids with Finite Convergent Presentations. 32-46
  Electronic Edition (Springer LINK) BibTeX
• Jordi Levy:
  Decidable and Undecidable Second-Order Unification Problems. 47-60
  Electronic Edition (Springer LINK) BibTeX
• Manfred Schmidt-Schauß, Klaus U. Schulz:
  On the Exponent of Periodicity of Minimal Solutions of Context Equation. 61-75
  Electronic Edition (Springer LINK) BibTeX
• Florent Jacquemard, Christoph Meyer, Christoph Weidenbach:
  Unification in Extension of Shallow Equational Theories. 76-90
  Electronic Edition (Springer LINK) BibTeX
• Qing Guo, Paliath Narendran, Sandeep K. Shukla:
  Unification and Matching in Process Algebras. 91-105
  Electronic Edition (Springer LINK) BibTeX
• Renate A. Schmidt:
  E-Unification for Subsystems of S4. 106-120
  Electronic Edition (Springer LINK) BibTeX
• Sébastien Limet, Pierre Réty:
  Solving Disequations Modulo Some Class of Rewrite Systems. 121-135
  Electronic Edition (Springer LINK) BibTeX
• Hubert Comon:
  About Proofs by Consistency (Abstract). 136-137
  Electronic Edition (Springer LINK) BibTeX
• Johannes Waldmann:
  Normalization of S-Terms is Decidable. 138-150
  Electronic Edition (Springer LINK) BibTeX
• Thomas Genet:
  Decidable Approximations of Sets of Descendants and Sets of Normal Forms. 151-165
  Electronic Edition (Springer LINK) BibTeX
• Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez:
  Algorithms and Reductions for Rewriting Problems. 166-180
  Electronic Edition (Springer LINK) BibTeX
• Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
  The Decidability of Simultaneous Rigid E-Unification with One Variable. 181-195
  Electronic Edition (Springer LINK) BibTeX
• Martin Müller, Joachim Niehren:
  Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. 196-210
  Electronic Edition (Springer LINK) BibTeX
• Witold Charatonik, Andreas Podelski:
  Co-definite Set Constraints. 211-225
  Electronic Edition (Springer LINK) BibTeX
• Thomas Arts, Jürgen Giesl:
  Modularity of Termination Using Dependency pairs. 226-240
  Electronic Edition (Springer LINK) BibTeX
• Claude Marché, Xavier Urbain:
  Termination of Associative-Commutative Rewriting by Dependency Pairs. 241-255
  Electronic Edition (Springer LINK) BibTeX
• Takahito Aoto, Yoshihito Toyama:
  Termination Transformation by Tree Lifting Ordering. 256-270
  Electronic Edition (Springer LINK) BibTeX
• Hongwei Xi:
  Towards Automated Termination Proofs through "Freezing". 271-285
  Electronic Edition (Springer LINK) BibTeX
• Olivier Danvy, Kristoffer Høgsbro Rose:
  Higher-Order Rewriting and Partial Evaluation. 286-301
  Electronic Edition (Springer LINK) BibTeX
• Yohji Akama:
  SN Combinators and Partial Combinatory Algebras. 302-316
  Electronic Edition (Springer LINK) BibTeX
• Dirk Fuchs:
  Coupling Saturation-Based Provers by Exchanging Positive/Negative Information. 317-331
  Electronic Edition (Springer LINK) BibTeX
• Nachum Dershowitz, Ralf Treinen:
  An On-line Problem Database. 332-342
  Electronic Edition (Springer LINK) BibTeX