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

Publisher Summary This chapter discusses order-sorted equational computation. Many-
sorted equational logic is the basis for algebraic specifications, rewriting techniques …

Many-sorted unification is considered; that is, unification in the many-sorted free algebras of
terms, where variables, as well as the domains and ranges of functions, are restricted to …

An efficient operational semantics for order-sorted algebras is given, based on the notion of
equational order-sorted rewriting with improvements such as general variables allowing to …

Generalization, also called anti-unification, is the dual of unification. Given terms t and t′, a
generalizer is a term t ″of which t and t′ are substitution instances. The dual of a most …

This paper studies unification for order-sorted equational logic. This logic generalizes
unsorted equational logic by allowing a partially ordered set of sorts, with the ordering …

This paper provides an introduction to many-sorted logics and motivates their use for
representation and reasoning. Perhaps the most important reason to be interested in many …

Within the CIP project, a transformation system CIP-S has been designed, formalized using
algebraic techniques, and developed into an implementation by means of program …

Les règles de transformation des problèmes equationnels sont donnes permettant, en
particulier, de décider de l'existence d'une solution fermée. Comme première application, il …