Unification of uninterpreted sorted terms

Part of the Lecture Notes in Computer Science book series (LNCS, volume 395)


In this part the properties of unification of uninterpreted order-sorted terms are investigated and rule-based unification algorithms are presented. We show that for elementary, regular signatures Σ-unification is decidable and finitary. In the general case when we have signatures with term declarations, unification is undecidable and infinitary. We also determine the unification behaviour under certain restrictions such as linearity.

Throughout this part we assume that the given signature Σ is finite.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Personalised recommendations