In unification theory, equational theories can be classified according to the existence and cardinality of minimal complete solution sets for equation systems. For unitary, finitary, and infinitary theories minimal complete solution sets always exist and are singletons, finite, or possibly infinite sets, respectively. In nullary theories, minimal complete sets do not exist for some equation systems. These classes form the unification hierarchy. We show that it is not possible to decide where a given equational theory resides in the unification hierarchy. Moreover, it is proved that for some classes this problem is not even recursively enumerable
We consider the problem of combining procedures that decide solvability of (dis)unification problems...
AbstractContext unification is a particular case of second-order unification in which all second-ord...
AbstractThe main result in this paper is that the class of finite acyclic theories contains only uni...
AbstractWe investigate the following classes of equational theories which are important in unificati...
AbstractWe propose an abstract framework to present unification and matching problems. We argue abou...
An equational theory ℰ is permutative if for all terms s, t: s = ℰt implies that the terms s and t c...
A critical question in unification theory is how to obtain a unification algorithm for the combinati...
An equational theory E is permutative if for all terms s, t: s =E t implies that the terms s and t c...
We show that unification in certain extensions of shallow equational theories is decidable. Our ext...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
We show that unification in certain extensions of shallow equational theories is decidable. Our exte...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
In this report we present some results on decidability, undecidability, semi-decidability, and non-s...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
We consider the problem of combining procedures that decide solvability of (dis)unification problems...
AbstractContext unification is a particular case of second-order unification in which all second-ord...
AbstractThe main result in this paper is that the class of finite acyclic theories contains only uni...
AbstractWe investigate the following classes of equational theories which are important in unificati...
AbstractWe propose an abstract framework to present unification and matching problems. We argue abou...
An equational theory ℰ is permutative if for all terms s, t: s = ℰt implies that the terms s and t c...
A critical question in unification theory is how to obtain a unification algorithm for the combinati...
An equational theory E is permutative if for all terms s, t: s =E t implies that the terms s and t c...
We show that unification in certain extensions of shallow equational theories is decidable. Our ext...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
We show that unification in certain extensions of shallow equational theories is decidable. Our exte...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
In this report we present some results on decidability, undecidability, semi-decidability, and non-s...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
We consider the problem of combining procedures that decide solvability of (dis)unification problems...
AbstractContext unification is a particular case of second-order unification in which all second-ord...
AbstractThe main result in this paper is that the class of finite acyclic theories contains only uni...