Proving and rewriting -- Proving correctness w.r.t. specifications with hidden parts -- Hybrid implementations of algebraic specifications -- Multi-modal logic programming using equational and order-sorted logic -- Logic programs with equational type specifications -- Higher-order order-sorted algebras -- Axiomatization of a functional logic language -- Fourier algorithm revisited -- Fixpoint techniques for non-monotone maps -- Domain theory for nonmonotonic functions -- On the strong completion of logic programs -- An equivalence preserving first order unfold/fold transformation system -- Propositional calculus problems in CHIP -- Unfolding and fixpoint semantics of concurrent constraint logic programs -- Eliminating negation from normal logic programs -- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic -- Recursive query processing in predicate-goal graph -- Implementation of completion by transition rules + control: ORME -- A matching process modulo a theory of categorical products -- Equation solving in conditional AC-theories -- Lazy narrowing in a graph machine -- An abstract concurrent machine for rewriting -- Applying term rewriting methods to finite groups -- Termination proofs by multiset path orderings imply primitive recursive derivation lengths -- Optimization of rewriting and complexity of rewriting -- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.