A complete unification algorithm for idempotent functions is presented. This algorithm is derivated from the universal unification algorithm, which is based on the narrowing relation. First an improvement for the universal algorithm is shown. Then these results are applied to the special case of idempotence resulting in an idempotent unification algorithm. Finally several refinements for this algorithm are proposed
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
We present a fast algorithm for uniform semi-unification based on adapting the Huet unification clos...
A complete algorithm for terms involving idempotent an idempotent-commutative functions is presented...
Lecture Notes in Artificial Intelligence 383, 1-10, 1989In this paper we prove the completeness of u...
We formalize a universal unification algorithm for the class of equational theories which is induced...
AbstractA comparison is performed between narrowing and SLD-resolution as regards their use in seman...
AbstractWe address the problem of unification modulo a set of equations, using the narrowing relatio...
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed a...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
[[abstract]]Unification is introduced as the basic operation in the inference-rule-of-resolution pri...
AbstractNarrowing is a well-known complete procedure for equational E-unification when E can be deco...
Unification in free idempotent semigroups is of unification type zero, i.e. there are unifiable term...
Idempotent mathematics, which is based on the so-called idempotent superposition principle, has achi...
Nominal Unification is an extension of first-order unification where terms can contain binders and u...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
We present a fast algorithm for uniform semi-unification based on adapting the Huet unification clos...
A complete algorithm for terms involving idempotent an idempotent-commutative functions is presented...
Lecture Notes in Artificial Intelligence 383, 1-10, 1989In this paper we prove the completeness of u...
We formalize a universal unification algorithm for the class of equational theories which is induced...
AbstractA comparison is performed between narrowing and SLD-resolution as regards their use in seman...
AbstractWe address the problem of unification modulo a set of equations, using the narrowing relatio...
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed a...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
[[abstract]]Unification is introduced as the basic operation in the inference-rule-of-resolution pri...
AbstractNarrowing is a well-known complete procedure for equational E-unification when E can be deco...
Unification in free idempotent semigroups is of unification type zero, i.e. there are unifiable term...
Idempotent mathematics, which is based on the so-called idempotent superposition principle, has achi...
Nominal Unification is an extension of first-order unification where terms can contain binders and u...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
We present a fast algorithm for uniform semi-unification based on adapting the Huet unification clos...