Abstract is missing.
- Rewrite Techniques in Theorem Proving (Abstract)Leo Bachmair. 1
- Redundancy Criteria for Constrained CompletionChristopher Lynch, Wayne Snyder. 2-16
- Bi-rewriting, a Term Rewriting Technique for Monotonic Order RelationsJordi Levy, Jaume Agustí-Cullell. 17-31
- A Case Study of Completion Modulo Distributivity and Abelian GroupsHantao Zhang. 32-46
- A Semantic Approach to Order-Sorted RewritingAndreas Werner. 47-61
- Distributing Equational Theorem ProvingJürgen Avenhaus, Jörg Denzinger. 62-76
- On the Correctness of a Distributed Memory Gröbner basis AlgorithmSoumen Chakrabarti, Katherine A. Yelick. 77-91
- Improving Transformation Systems for General ::::E::::-UnificationMax Moser. 92-105
- Equational and Membership Constraints for Finite TreesJoachim Niehren, Andreas Podelski, Ralf Treinen. 106-120
- Regular Path Expression in Feature LogicRolf Backofen. 121-135
- Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract)Jean H. Gallier. 136
- Some Lambda Calculi with Categorial Sums and ProductsDaniel J. Dougherty. 137-151
- Paths, Computations and Labels in the Lambda-CalculusAndrea Asperti, Cosimo Laneve. 152-167
- Confluence and SuperdevelopmentsFemke van Raamsdonk. 168-182
- Relating Graph and Term Rewriting via Böhm ModelsZena M. Ariola. 183-197
- Topics in TerminationNachum Dershowitz, Charles Hoot. 198-212
- Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. 213-227
- Simple Termination is DifficultAart Middeldorp, Bernhard Gramlich. 228-242
- Optimal Normalization in Orthogonal Term Rewriting SystemsZurab Khasidashvili. 243-258
- A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report)John Field. 259-273
- Generating Tables for Bottom-Up MatchingErnst Lippe. 274-288
- On some Algorithmic Problems for Groups and MonoidsSergei I. Adian. 289-300
- Combination Techniques and Decision Problems for DisunificationFranz Baader, Klaus U. Schulz. 301-315
- The Negation Elimination from Syntactic Equational Formula is DecidableMohamed Tajine. 316-327
- Encompassment Properties and Automata with ConstraintsAnne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet. 328-342
- Recursively Defined Tree TransductionsJean-Claude Raoult. 343-357
- AC Complement Problems: Satisfiability and Negation EliminationMaribel Fernández. 358-373
- A Precedence-Based Total AC-Compatible OrderingAlbert Rubio, Robert Nieuwenhuis. 374-388
- Extension of the Associative Path Ordering to a Chain of Associative Commutative SymbolsCatherine Delor, Laurence Puel. 389-404
- Polynomial Time Termination and Constraint Satisfaction TestsDavid A. Plaisted. 405-420
- Linear Interpretations by Counting PatternsUrsula Martin. 421-433
- Some Undecidable Termination Problems for Semi-Thue Systems (Abstract)Géraud Sénizergues. 434
- Saturation of First-Order (Constrained) Clauses with the ::::Saturate:::: SystemPilar Nivela, Robert Nieuwenhuis. 436-440
- MERILL: An Equational Reasoning System in Standard MLBrian Matthews. 441-445
- Reduce the Redex -> ReDuXReinhard Bündgen. 446-450
- AGG - An Implementation of Algebraic Graph RewritingMichael Löwe, Martin Beyer. 451-456
- Smaran: A Congruence-Closure Based System for Equational ComputationsRakesh M. Verma. 457-461
- LAMBDALG: Higher Order Algebraic Specification LanguageYexuan Gui, Mitsuhiro Okada. 462-466
- More Problems in RewritingNachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop. 468-487