Abstract is missing.
- Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract)Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries. 1-12
- Redex Capturing in Term Graph Rewriting (Concise Version)William M. Farmer, Ronald J. Watro. 13-24
- Rewriting, and Equational Unification: the Higher-Order CasesDavid A. Wolfram. 25-36
- Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract)Daniel J. Dougherty. 37-48
- Incremental Termination Proofs and the Length of DerivationsFrank Drewes, Clemens Lautemann. 49-61
- Time Bounded Rewrite Systems and Termination Proofs by Generalized EmbeddingDieter Hofbauer. 62-73
- Detecting Redundant Narrowing Derivations by the LSE-SL Reducability TestStefan Krischer, Alexander Bockmayr. 74-85
- Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization ProblemsFranz Baader. 86-97
- AC Unification Through Order-Sorted AC1 UnificationEric Domenjoud. 98-111
- Narrowing Directed by a Graph of TermsJacques Chabin, Pierre Réty. 112-123
- Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational UnificationFranz Baader, Werner Nutt. 124-135
- Undecidable Properties of Syntactic TheoriesFrancis Klay. 136-149
- Goal Directed Strategies for ParamodulationWayne Snyder, Christopher Lynch. 150-161
- Minimal Solutions of Linear Diophantine Systems: Bounds and AlgorithmsLoic Pottier. 162-173
- Proofs in Parameterized SpecificationHélène Kirchner. 174-187
- Completeness of Combinations of Constructor SystemsAart Middeldorp, Yoshihito Toyama. 188-199
- Modular Higher-Order ::::E::::-UnificationTobias Nipkow, Zhenyu Qian. 200-214
- On Confluence for Weakly Normalizing SystemsPierre-Louis Curien, Giorgio Ghelli. 215-225
- Program Transformation and RewritingFrançoise Bellegarde. 226-239
- An Efficient Representation of Arithmetic for Term RewritingDave Cohen, Phil Watson. 240-251
- Query Optimization Using Rewrite RulesSieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan. 252-263
- Boolean Algebra Admits No Convergent Term Rewriting SystemRolf Socher-Ambrosius. 264-274
- Decidability of Confluence and Termination of Monadic Term Rewriting SystemsKai Salomaa. 275-286
- Bottom-Up Tree Pushdown Automata and Rewrite SystemsJean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi. 287-298
- On Relationship Between Term Rewriting Systems and Regular Tree LanguagesGregory Kucherov. 299-311
- The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded DegreeFranz-Josef Brandenburg. 312-322
- Left-to-Right Tree Pattern MatchingAlbert Gräf. 323-334 [doi]
- Incremental Techniques for Efficient Normalization of Nonlinear Rewrite SystemsR. Ramesh, I. V. Ramakrishnan. 335-347
- On Fairness of Completion-Based Theorem Proving StrategiesMaria Paola Bonacina, Jieh Hsiang. 348-360
- Proving Equational and Inductive Theorems by Completion and Embedding TechniquesJürgen Avenhaus. 361-373
- Divergence Phenomena during CompletionAndrea Sattler-Klein. 374-385
- Simulation Buchberger s Algorithm by Knuth-Bendix CompletionReinhard Bündgen. 386-397
- On Proving Properties of Completion StrategiesMiki Hermann. 398-410
- On Ground AC-CompletionClaude Marché. 411-422
- Any Gound Associative-Commutative Theory Has a Finite Canonical SystemPaliath Narendran, Michaël Rusinowitch. 423-434
- A Narrowing-Based Theorem ProverUlrich Fraus. 435-436
- ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with PrioritiesMichel Billaud. 437-438
- EMMY: A Refutational Theorem Prover for First-Order Logic with EquationAline Deruyver. 439-441
- The Tecton Proof SystemRaj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie. 442-444
- Open Problems in RewritingNachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop. 445-456