During the last years unification theory has become an important subfield of automated reasoning and logic programming. The aim of the present paper is to relate unification theory to classical work on equation solving in algebra and mathematical logic. We show that many problems in unification theory have their counterpart in classical mathematics and illustrate by various examples how classical results can be used to answer unification-theoretic questions
We consider several unification problems in mathematics. We refer to transcendental numbers. Further...
The unification problem and several variants are presented. Various algorithms and data structures a...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
During the last years unification theory has become an important subfield of automated reasoning and...
Unification is a fundamental operation in various areas of computer science, in particular in automa...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
publication lies with the author. Unification in the presence of an equational theory is an importan...
We consider several unification problems in mathematics. We refer to transcendental numbers. Further...
The unification problem and several variants are presented. Various algorithms and data structures a...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
During the last years unification theory has become an important subfield of automated reasoning and...
Unification is a fundamental operation in various areas of computer science, in particular in automa...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
AbstractMost of the work on the combination of unification algorithms for the union of disjoint equa...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
AbstractUnification in equational theories, that is, solving equations in varieties, is of special r...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
publication lies with the author. Unification in the presence of an equational theory is an importan...
We consider several unification problems in mathematics. We refer to transcendental numbers. Further...
The unification problem and several variants are presented. Various algorithms and data structures a...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...