Affiliation:
1. Univ. Karlsruhe, Karlsruhe, Federal Republic of Germany
Abstract
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 certain subsets of the universe, given as a potentially infinite hierarchy of sorts. It is shown that complete and minimal sets of unifiers may not always exist for many-sorted unification. Conditions for sort hierarchies that are equivalent for the existence of these sets with one, finitely many, or infinitely many elements are presented. It is also proved that being a forest-structured sort hierarchy is a necessary and sufficient criterion for the Robinson Unification Theorem to hold for many-sorted unification. An algorithm for many-sorted unification is given.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference28 articles.
1. BIRKHOFF G. Lattice Theory. Vol. 25 American Mathematical Society Colloquium Publications Providence R.I. 1967. BIRKHOFF G. Lattice Theory. Vol. 25 American Mathematical Society Colloquium Publications Providence R.I. 1967.
2. COHN P.M. Universal Algebra. Reidel Dordrecht 1981. COHN P.M. Universal Algebra. Reidel Dordrecht 1981.
3. Rewrite systems on a lattice of types;CUNNINGHAM R. J.;Acta Inf.,1985
4. Translating Spanish into logic through logic;DAHL V;Am. J. Comput. Linguist.,1981
5. Properties of substitutions and unifications
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献