Two approaches to equational unification can be distinguished. The syntactic approach relies heavily on the syntactic structure of the identities that define the equational theory. The semantic approach exploits the structure of the algebras that satisfy the theory. With this paper we pursue the semantic approach to unification. We consider the class of theories for which solving unification problems is equivalent to solving systems of linear equations over a semiring. This class has been introduced by the authors independently of each other as commutative theories (Baader) and monoidal theories (Nutt). The class encompasses important examples like the theories of abelian monoids, idempotent abelian monoids, and abelian groups. We identify ...
Aus der Einleitung: „Equational unification is a generalization of syntactic unification in which se...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
AbstractWe establish that there is no polynomial-time general combination algorithm for unification ...
Although for numerous equational theories unification algorithms have been developed there is still ...
Although unification algorithms have been developed for numerous equational theories there is still ...
From the work of Siekmann & Livesey, and Stickel it is known how to unify two terms in an associativ...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
AbstractUnification is one of the basic concepts of automated theorem proving. It concerns such ques...
AbstractA complete unification algorithm is presented for the combination of two theories E in T(F,X...
Equational unification is the problem of solving an equation modulo equational axioms. In this paper...
This paper presents a method for combining equational unification algorithms to handle terms contain...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
Abstract. We study unification and matching in equational theories based on semirings, which include...
The present work studies problems of unification and matching in equational theories based on idempo...
Aus der Einleitung: „Equational unification is a generalization of syntactic unification in which se...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
AbstractWe establish that there is no polynomial-time general combination algorithm for unification ...
Although for numerous equational theories unification algorithms have been developed there is still ...
Although unification algorithms have been developed for numerous equational theories there is still ...
From the work of Siekmann & Livesey, and Stickel it is known how to unify two terms in an associativ...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
AbstractUnification is one of the basic concepts of automated theorem proving. It concerns such ques...
AbstractA complete unification algorithm is presented for the combination of two theories E in T(F,X...
Equational unification is the problem of solving an equation modulo equational axioms. In this paper...
This paper presents a method for combining equational unification algorithms to handle terms contain...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
Abstract. We study unification and matching in equational theories based on semirings, which include...
The present work studies problems of unification and matching in equational theories based on idempo...
Aus der Einleitung: „Equational unification is a generalization of syntactic unification in which se...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
AbstractWe establish that there is no polynomial-time general combination algorithm for unification ...