The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines.

Rewrite-based automated reasoning: Challenges ahead.- Fine-grained concurrent completion.- AC-complete unification and its application to theorem proving.- Superposition theorem proving for abelian groups represented as integer modules.- Symideal Gröbner bases.- Termination of constructor systems.- Dummy elimination in equational rewriting.- On proving termination by innermost termination.- A recursive path ordering for higher-order terms in ?-long ?-normal form.- Higher-order superposition for dependent types.- Higher-order narrowing with definitional trees.- Design of a proof assistant.- A compiler for nondeterministic term rewriting systems.- Combinatory reduction systems with explicit substitution that preserve strong normalisation.- Confluence properties of extensional and non-extensional ?-calculi with explicit substitutions (extended abstract).- On the power of simple diagrams.- Coherence for sharing proof nets.- Modularity of termination in term graph rewriting.- Confluence of terminating conditional rewrite systems revisited.- Applications of rewrite techniques in monoids and rings.- Compositional term rewriting: An algebraic proof of Toyama's theorem.- The first-order theory of one-step rewriting is undecidable.- An algorithm for distributive unification.- On the termination problem for one-rule semi-Thue system.- Efficient second-order matching.- Linear second-order unification.- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type.- Decidable approximations of term rewriting systems.- Semantics and strong sequentially of priority term rewriting systems.- Higher-order families.- A new proof manager and graphic interface for the larch prover.- ReDuX 1.5: New facets of rewriting.- CiME: Completionmodulo E.- Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover.- EPIC: An equational language Abstract machine and supporting tools.- SPIKE-AC: A system for proofs by induction in Associative-Commutative theories.- On gaining efficiency in completion-based theorem proving.