Abstract is missing.
- Origin Tracking in Term Rewriting (Abstract)Jan Willem Klop. 1 [doi]
- Simultaneous Critical Pairs and Church-Rosser PropertySatoshi Okui. 2-16 [doi]
- Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence RelationEnno Ohlebusch. 17-31 [doi]
- Automatic Monoids Versus Monoids with Finite Convergent PresentationsFriedrich Otto, Andrea Sattler-Klein, Klaus Madlener. 32-46 [doi]
- Decidable and Undecidable Second-Order Unification ProblemsJordi Levy. 47-60 [doi]
- On the Exponent of Periodicity of Minimal Solutions of Context EquationManfred Schmidt-Schauß, Klaus U. Schulz. 61-75 [doi]
- Unification in Extension of Shallow Equational TheoriesFlorent Jacquemard, Christoph Meyer, Christoph Weidenbach. 76-90 [doi]
- Unification and Matching in Process AlgebrasQing Guo, Paliath Narendran, Sandeep K. Shukla. 91-105 [doi]
- ::::E::::-Unification for Subsystems of ::::S4::::Renate A. Schmidt. 106-120 [doi]
- Solving Disequations Modulo Some Class of Rewrite SystemsSébastien Limet, Pierre Réty. 121-135 [doi]
- About Proofs by Consistency (Abstract)Hubert Comon. 136-137 [doi]
- Normalization of S-Terms is DecidableJohannes Waldmann. 138-150 [doi]
- Decidable Approximations of Sets of Descendants and Sets of Normal FormsThomas Genet. 151-165 [doi]
- Algorithms and Reductions for Rewriting ProblemsRakesh M. Verma, Michaël Rusinowitch, Denis Lugiez. 166-180 [doi]
- The Decidability of Simultaneous Rigid ::::E::::-Unification with One VariableAnatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov. 181-195 [doi]
- Ordering Constraints over Feature Trees Expressed in Second-Order Monadic LogicMartin Müller, Joachim Niehren. 196-210 [doi]
- Co-definite Set ConstraintsWitold Charatonik, Andreas Podelski. 211-225 [doi]
- Modularity of Termination Using Dependency pairsThomas Arts, Jürgen Giesl. 226-240 [doi]
- Termination of Associative-Commutative Rewriting by Dependency PairsClaude Marché, Xavier Urbain. 241-255 [doi]
- Termination Transformation by Tree Lifting OrderingTakahito Aoto, Yoshihito Toyama. 256-270 [doi]
- Towards Automated Termination Proofs through "Freezing"Hongwei Xi. 271-285 [doi]
- Higher-Order Rewriting and Partial EvaluationOlivier Danvy, Kristoffer Høgsbro Rose. 286-301 [doi]
- SN Combinators and Partial Combinatory AlgebrasYohji Akama. 302-316 [doi]
- Coupling Saturation-Based Provers by Exchanging Positive/Negative InformationDirk Fuchs. 317-331 [doi]
- An On-line Problem DatabaseNachum Dershowitz, Ralf Treinen. 332-342 [doi]