The unification problem and several variants are presented. Various algorithms and data
structures are discussed. Research on unification arising in several areas of computer …

This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader
and Nipkow cover all the basic material--abstract reduction systems, termination …

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 …

Unification was originally introduced in automated deduction and term rewriting, but has
recently also found applications in other fields. In this article, we give a survey of the results …

The unification problem in a disjoint combination of equational theories, E 1+...+ E n, is
reduced to a combination of two kinds of problems in the E j's: the pure unification, problem …

Unification Theory Page 1 Unification Theory 315 Ji3rg H. SIEKMANN Universitiit Kaiserslautern,
D-6750 Kaiserslautern, West German)' This article surveys what is presently known in …

We study the unification problem for a class of equational theories that comprises important
examples like abelian monoids (AC), idempotent abelian monoids (ACI), and abelian …

In this article, we address two problems related to idempotent anti-unification. First, we show
that there exists an anti-unification problem with a single idempotent symbol that has an …

Unification in equational theories, ie, solving of equations in varieties, is a basic operation in
computational logic, in artificial intelligence (AI) and in many applications of computer …

We investigate the following classes of equational theories which are important in unification
theory: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular …