AbstractWe propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of a basis of unifiers. In particular, we prove the nonexistence of complete sets of minimal unifiers (and matchers) in some equational theories, even regular
Abstract. We study unification and matching in equational theories based on semirings, which include...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
AbstractThis paper addresses the problem of systematically building a matching algorithm for the uni...
AbstractWe propose an abstract framework to present unification and matching problems. We argue abou...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
AbstractWe investigate the following classes of equational theories which are important in unificati...
The problem of combining matching algorithms for equational theories with disjoint signatures is stu...
. This paper addresses the problem of systematically building a matching algorithm for the union of ...
AbstractAn equational formula is a first-order formula over an alphabet F of function symbols and th...
Colloque avec actes et comité de lecture. internationale.International audienceSolving equational pr...
This paper presents a method for combining equational unification algorithms to handle terms contain...
AbstractUnification is one of the basic concepts of automated theorem proving. It concerns such ques...
The present work studies problems of unification and matching in equational theories based on idempo...
AbstractA complete unification algorithm is presented for the combination of two theories E in T(F,X...
This paper studies unification for order-sorted equational logic. This logic generalizes unsorted eq...
Abstract. We study unification and matching in equational theories based on semirings, which include...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
AbstractThis paper addresses the problem of systematically building a matching algorithm for the uni...
AbstractWe propose an abstract framework to present unification and matching problems. We argue abou...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
AbstractWe investigate the following classes of equational theories which are important in unificati...
The problem of combining matching algorithms for equational theories with disjoint signatures is stu...
. This paper addresses the problem of systematically building a matching algorithm for the union of ...
AbstractAn equational formula is a first-order formula over an alphabet F of function symbols and th...
Colloque avec actes et comité de lecture. internationale.International audienceSolving equational pr...
This paper presents a method for combining equational unification algorithms to handle terms contain...
AbstractUnification is one of the basic concepts of automated theorem proving. It concerns such ques...
The present work studies problems of unification and matching in equational theories based on idempo...
AbstractA complete unification algorithm is presented for the combination of two theories E in T(F,X...
This paper studies unification for order-sorted equational logic. This logic generalizes unsorted eq...
Abstract. We study unification and matching in equational theories based on semirings, which include...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
AbstractThis paper addresses the problem of systematically building a matching algorithm for the uni...