AbstractMost knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic representation, support one basic operation: “matching of descriptions”. This operation, called unification in work on deduction, is the “addition-and-multiplication” of AI-systems and is consequently often supported by special purpose hardware or by a fast instruction set on most AI-machines. Unification theory provides the formal framework for investigations into the properties of this operation. This article surveys what is presently known in unification theory and records its early history
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
During the last years unification theory has become an important subfield of automated reasoning and...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
AbstractMost knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
Aus der Einleitung: „Equational unification is a generalization of syntactic unification in which se...
A unifier of two terms s and t is a substitution sigma such that ssigma=tsigma and for first-order t...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
Unification is a fundamental process upon which many methods for automated deduction are based. Uni...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
An essential element of automated deduction systems is unification algorithms which identify general...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
AbstractA complete unification algorithm is presented for the combination of two theories E in T(F,X...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
Dependently typed languages such as Agda, Coq and Idris use a syntactic first-order unification algo...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
During the last years unification theory has become an important subfield of automated reasoning and...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
AbstractMost knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
Aus der Einleitung: „Equational unification is a generalization of syntactic unification in which se...
A unifier of two terms s and t is a substitution sigma such that ssigma=tsigma and for first-order t...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
Unification is a fundamental process upon which many methods for automated deduction are based. Uni...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
An essential element of automated deduction systems is unification algorithms which identify general...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
AbstractA complete unification algorithm is presented for the combination of two theories E in T(F,X...
AbstractEmbedding sets as a datastructure into resolution-based deduction requires a unification alg...
Dependently typed languages such as Agda, Coq and Idris use a syntactic first-order unification algo...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
During the last years unification theory has become an important subfield of automated reasoning and...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...