AbstractWe present an Associative-Commutative unification algorithm and its implementation in the C language. The main point is that both the specification and the program are based on solving systems of equations. Benchmarks are proposed for evaluating the performance of the implementation of this algorithm. They demonstrate improvements not only in time and space but also in size of the complete set of unifiers generated
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
This report consists of three independent parts that each study important steps in the matching and ...
AbstractWe present an Associative-Commutative unification algorithm and its implementation in the C ...
We have discovered an efficient algorithm for matching and unification in associative-commutative (A...
An essential element of automated deduction systems is unification algorithms which identify general...
Unification algorithms are an essential component of automated reasoning and term rewriting systems....
This note reports about the implementation of AC-unification algorithms, based on the variable-abstr...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
AbstractPure associative unification is equivalent to the resolution of word equations. We give a sh...
We consider anti-unification for simply typed lambda terms in associative, commutative, and associat...
In a recent paper [BS91] we introduced a new unification algorithm for the combination of disjoint e...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
Version revue de CRIN - 89-R-167SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-n...
From the work of Siekmann & Livesey, and Stickel it is known how to unify two terms in an associativ...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
This report consists of three independent parts that each study important steps in the matching and ...
AbstractWe present an Associative-Commutative unification algorithm and its implementation in the C ...
We have discovered an efficient algorithm for matching and unification in associative-commutative (A...
An essential element of automated deduction systems is unification algorithms which identify general...
Unification algorithms are an essential component of automated reasoning and term rewriting systems....
This note reports about the implementation of AC-unification algorithms, based on the variable-abstr...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
AbstractPure associative unification is equivalent to the resolution of word equations. We give a sh...
We consider anti-unification for simply typed lambda terms in associative, commutative, and associat...
In a recent paper [BS91] we introduced a new unification algorithm for the combination of disjoint e...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
Version revue de CRIN - 89-R-167SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-n...
From the work of Siekmann & Livesey, and Stickel it is known how to unify two terms in an associativ...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
This report consists of three independent parts that each study important steps in the matching and ...