Publisher Summary This chapter focuses on rewrite systems, which are directed equations
used to compute by repeatedly replacing sub-terms of a given formula with equal terms until …

Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

This is an introduction to the philosophy and use of OBJ, emphasizing its oper-ational
semantics, with aspects of its history and its logical semantics. Release 2 of OBJ3 is …

An equational system is a set of equations. Often we are interested in knowing if an equation
follows logically from the given set. For example, given the equations x+ y= y+ x,(x+ y)+ z …

Languages that integrate functional and logic programming with a complete operational
semantics are based on narrowing, a unification-based goal-solving mechanism which …

Reduktions-und Vervollständigungstechniken dienen zum Rechnen und Schließen in
gleichungsdefinierten algebraischen Strukturen wie Abstrakten Datentypen. In dieser ersten …

We define equality constrained equations and clauses and use them to prove the
completeness of what we have called basic superposition: a restricted form of superposition …

We focus on termination proof techniques for unconditional term rewriting systems using
simplification orderings. Throughout the last few years numerous (simplification) orderings …

We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as
objects in a global manner. In this first approach the formalism is restricted to first-order …

Partial evaluation is a powerful and general program optimization technique with many
successful applications. Existing PE schemes do not apply to expressive rule-based …