Abstract
The following classes of equational theories, which are important in unification theory, are presented: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and Ω-free theories. The relationships between the particular theories are shown and the connection between these classes and the unification hierarchy is pointed out. We give an equational theory that always has a minimal set of unifiers for single equations, but there exists a system of two equations which has no minimal set of unifiers. This example suggests that the definition of the unification type of an equational theory has to be changed. Furthermore we study the conditions, under which minimal sets of unifiers always exist.
Decidability results about the membership of equational theories to the classes above are presented. It is proved that Noetherianness, simplicity, almost collapse freeness and Ω-freeness are undecidable. We show that it is not possible to decide where a given equational theory resides in the unification hierarchy and where in the matching hierarchy.
...!mcvax!unido!uklirb!buerkert
Chapter PDF
Similar content being viewed by others
References
Birkhoff, G.: On the Structure of Abstract Algebra, Proc. Cambridge Phil. Soc., Vol. 31, p. 433–454, (1935)
Bürckert, H.-J., Herold, A. and Schmidt-Schauß, M.: On Equational Theories, Unification and Decidability, to appear as SEKI-Report SR-19-86, Universität Kaiserslautern, (1986)
Burris, S. and Sankappanavar, H.P.: A Course in Universal Algebra, Springer, (1981)
Book, R. and Siekmann, J.H.: On the Unification Hierarchy, Proc. of GWAI'85, Springer, p. 111–117, (1985)
Bürckert, H.-J.: Some Relationships between Unification, Restricted Unification and Matching, in Proc. of the 8th CADE, Springer, LNCS 230, p. 514–524, (1986)
Fages, F. and Huet, G.: Unification and Matching in Equational Theories, Proc. of CAAP'83 (ed. G. Ausiello and M. Protasi), Springer, LNCS 159, p. 205–220, (1983). Also in TCS 43, pp. 189–200, (1986)
Goguen, J. A., Thatcher, J.W. and Wagner, E. G.: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, in Current Trends in Programming Methodology, Vol.4, Data Structuring (ed. R. T. Yeh), Prentice Hall, (1978)
Grätzer, G.: Universal Algebra, Springer, (1979)
Herold, A.: A Combination of Unification Algorithms, in Proc. of the 8th CADE, Springer, LNCS 230, p. 450–469, (1986)
Hullot, J.M.: Canonical Forms and Unification, in Proc. of 5th CADE (eds. W. Bibel and R. Kowalski), Springer, LNCS 87, p. 318–334, (1989)
Huet, G. and Oppen, D. C.: Equations and Rewrite Rules: A Survey, in Formal Languages: Perspectives and Open Problems (ed R. Book), Academic Press, (1980)
Huet, G.: Résolution d'équations dans des langages d'ordre 1, 2 ... ω, Thèse de doctorat d'état, Université Paris VII, (1976)
Lankford, D.S. and Ballantyne, A.M.: Decision Procedures for Simple Equational Theories with Permutative Axioms: Complete Sets of Reductions, Report ATP-37, University of Texas, Austin, (1977)
Knuth, D.E. and Bendix, P.B.: Simple Word Problems in Universal Algebras, in Computational Problems in Abstract Algebras (ed. J. Leech), Pergamon Press, p. 263–297, (1970)
Kirchner, C.: Methodes et outils de conception systematique d'algorithmes d'unification dans les théories équationelles, Thèse de doctorat d'état, (in French) Université de Nancy 1, (1985)
Loveland, D.: Automated Theorem Proving: A Logical Basis, North-Holland, (1978)
Markov, R.: Impossibility of Algorithms for Recognizing Some Properties of Associative Systems, Dokl. Akad. Nauk SSSR 77, p. 953–956, (1951).
Martelli, A. and Montanari, U.: An Efficient Unification Algorithm, ACM TOPLAS, Vol.4, No 2, p. 258–282, (1982)
Mostowski, A.: Review of [Ma 51], J. Symbolic Logic 17, p. 151–152, (1952)
Narendran, P., O'Dúnlaing, C. and Rolletschek, H.: Complexity of Certain Decision Problems About Congruential Languages, Journal of Computer and System Sciences, Vol.30, p. 343–358, (1985)
Robinson, J. A.: A Machine-Oriented Logic Based on the Resolution Principle, JACM 12, No. 1, p. 23–41, (1965)
Schmidt-Schauß, M.: Unification under Associativity and Idempotence is of Type Nullary, Journal of Automated Reasoning 2,3, pp. 277–281, (1986)
Schmidt-Schauß, M.: Unification Properties of Idempotent Semigroups, SEKI Report SR-86-07, Universität Kaiserslautern, (1986)
Siekmann, J.: Universal Unification, in Proc. of 7th CADE, Springer, LNCS 170, p. 1–42, (1984)
Siekmann, J.: Unification Theory, in Proc. of ECAI'86, Vol. II, p. vi–xxxv, Brighton, (1986)
Szabó, P.: Unifikationstheorie Erster Ordnung, Dissertation (in German), Universität Karlsruhe, (1982)
Taylor, W.: Equational Logic, Houston Journal of Mathematics 5, (1979)
Tidén, E.: Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols, in Proc. of 8th CADE, Springer, LCNS 230, p. 431–449, (1986)
Tidén, E.: First-Order Unification in Combinations of Equational Theories, Thesis, Stockholm, (1986)
Wos, L., Robinson, G.A., Carson, D. and Shalla, L.: The Concept of Demodulation in Theorem Proving, JACM 14, No. 4, p. 698–709, (1967)
Yelick, K.: Combining Unification Algorithms for Confined Regular Equational Theories, in Proc. of RTA'85 (ed J.-P. Jouannaud), Springer, LNCS 202, p. 365–380, (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bürckert, HJ., Herold, A., Schmidt-Schauß, M. (1987). On equational theories, unification and decidability. In: Lescanne, P. (eds) Rewriting Techniques and Applications. RTA 1987. Lecture Notes in Computer Science, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17220-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-17220-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17220-8
Online ISBN: 978-3-540-47421-0
eBook Packages: Springer Book Archive