Add to ORKGA standard result from unification theory says that if a finite set E of equations between finite terms is unifiable, then there exists a most general unifier for E. In this paper, the theorem is generalized to the case where E may be infinite. In order to obtain this result, substitutions are allowed to have an infinite domain
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
AbstractIn this note we refine a result in Berarducci and Venturini Zilli (1993), by showing that th...
AbstractWe introduce the class of contraction algebras in which the algebra of infinite and finite t...
A standard result from unification theory says that if a finite set E of equations between finite te...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
AbstractWe investigate the following classes of equational theories which are important in unificati...
AbstractAn equational formula is a first-order formula over an alphabet F of function symbols and th...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
AbstractWe propose an abstract framework to present unification and matching problems. We argue abou...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
We present restricted T-unification that is unification of terms under a given equational theory T w...
A unifier of two terms s and t is a substitution sigma such that ssigma=tsigma and for first-order t...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
AbstractIn this note we refine a result in Berarducci and Venturini Zilli (1993), by showing that th...
AbstractWe introduce the class of contraction algebras in which the algebra of infinite and finite t...
A standard result from unification theory says that if a finite set E of equations between finite te...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
AbstractWe investigate the following classes of equational theories which are important in unificati...
AbstractAn equational formula is a first-order formula over an alphabet F of function symbols and th...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
AbstractWe propose an abstract framework to present unification and matching problems. We argue abou...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
We present restricted T-unification that is unification of terms under a given equational theory T w...
A unifier of two terms s and t is a substitution sigma such that ssigma=tsigma and for first-order t...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
AbstractIn this note we refine a result in Berarducci and Venturini Zilli (1993), by showing that th...
AbstractWe introduce the class of contraction algebras in which the algebra of infinite and finite t...