Add to ORKGA critical question in unification theory is how to obtain a unification algorithm for the combination of non-disjoint equational theories when there exists unification algorithms for the constituent theories. The problem is known to be difficult and can easily be seen to be undecidable in the general case. Therefore, previous work has focused on identifying specific condition
Short version to appear in the Proceedings of the 13th International Symposium on Frontiers of Combi...
The paper presents a nondeterministic algorithm for unifying pairs of terms in equational theories c...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
International audienceA novel approach is described for the combination of unification algorithms fo...
International audienceA critical question in unification theory is how to obtain a unification algor...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
We consider the problem of combining procedures that decide solvability of (dis)unification problems...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
AbstractThis paper addresses the problem of systematically building a matching algorithm for the uni...
International audienceWe investigate a hierarchical combination approach to the unification problem ...
Previous work on combination techniques considered the question of how to combine unification algori...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
In a recent paper [BS91] we introduced a new unification algorithm for the combination of disjoint e...
. This paper addresses the problem of systematically building a matching algorithm for the union of ...
AbstractPrevious work on combination techniques considered the question of how to combine unificatio...
Short version to appear in the Proceedings of the 13th International Symposium on Frontiers of Combi...
The paper presents a nondeterministic algorithm for unifying pairs of terms in equational theories c...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
International audienceA novel approach is described for the combination of unification algorithms fo...
International audienceA critical question in unification theory is how to obtain a unification algor...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
We consider the problem of combining procedures that decide solvability of (dis)unification problems...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
AbstractThis paper addresses the problem of systematically building a matching algorithm for the uni...
International audienceWe investigate a hierarchical combination approach to the unification problem ...
Previous work on combination techniques considered the question of how to combine unification algori...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
In a recent paper [BS91] we introduced a new unification algorithm for the combination of disjoint e...
. This paper addresses the problem of systematically building a matching algorithm for the union of ...
AbstractPrevious work on combination techniques considered the question of how to combine unificatio...
Short version to appear in the Proceedings of the 13th International Symposium on Frontiers of Combi...
The paper presents a nondeterministic algorithm for unifying pairs of terms in equational theories c...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...