A complete algorithm for terms involving idempotent an idempotent-commutative functions is presented. The main results are: The unification problem for both cases is decidable and the set of unifiers is finite for both problems
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
The unification problem for expressions of third order dyadic logic is proved to be undecidable by a...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
A complete unification algorithm for idempotent functions is presented. This algorithm is derivated f...
Unification in free idempotent semigroups is of unification type zero, i.e. there are unifiable term...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
The present work studies problems of unification and matching in equational theories based on idempo...
The observation that unification under associativity and commutativity reduces to the solution of ce...
AbstractUnification in the equational theory of one-sided distributivity and a multiplicative unit i...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
International audienceUnification modulo the theory defined by a single equation which specifies tha...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
We consider unification of terms under the equational theory of two-sided distributivity D with the ...
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
The unification problem for expressions of third order dyadic logic is proved to be undecidable by a...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
A complete unification algorithm for idempotent functions is presented. This algorithm is derivated f...
Unification in free idempotent semigroups is of unification type zero, i.e. there are unifiable term...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
The present work studies problems of unification and matching in equational theories based on idempo...
The observation that unification under associativity and commutativity reduces to the solution of ce...
AbstractUnification in the equational theory of one-sided distributivity and a multiplicative unit i...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
International audienceUnification modulo the theory defined by a single equation which specifies tha...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
We consider unification of terms under the equational theory of two-sided distributivity D with the ...
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
The unification problem for expressions of third order dyadic logic is proved to be undecidable by a...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
DOI
Add to ORKG