Unification theory or equation solving in abstract algebras has become increasingly important in theoretical computer science and artificial intelligence studies. Unification theory has been successfully applied to almost all areas of computer science, from databases to non-classical logics to term-rewriting systems and to natural language processing. This volume presents a detailed summary of the latest developments in unification theory and algorithms.
- Hardback | 616 pages
- 01 Jan 1991
- Elsevier Science Publishing Co Inc
- Academic Press Inc
- San Diego, United States
Table of contents
Unification theory, J.H.Siekmann; on equational theories, unification and (un)dicidability, H.J.Burckert et al; unification in permutative equational theories is undecidable, M.Schmidt-Schauss; matching - a special case of unification?, H.J.Burckert; on the relationship of congruence closure and unification, P.C.Kanellakis and P.Z.Revesz; on the logic of unification, P.Le Chernadec; unification in a combination of arbitrary disjoint equational theories, M.Schmidt-Schauss; unification in boolean rings and abelian groups, A.Boudet et al; equational problems and disunification, H.Comon and P.Lescanne; solving word equations, H.Abdulrab and J.P.Pecuchet; efficient solution of linear diophantine equations, M.Clausen and A.Fortenbacher; adventures in associative-commutative unification, P.Lincoln and J.U.Christian; unification in commutative theories, F.Baader; boolean unification - the story so far, U.Martin and T.Nipkow; order-sorted unification, J.Meseguer et al; inheritance hierarchies - semantics and unification, G.Smolka and H.Ait-Kaci; basic narrowing revisited, W.Nutt et al; enumerating outer narrowing derivation for constructor-based term rewriting systems, J.H.You; higher-order unification revisited - complete sets of transformations, W.Snyder and J.Gallier.