Add to ORKGProceedings of the 19th international workshop on Unification, held during RDP'2005 in Nara, Japan, on April 22, 2005.UNIF is the main international meeting on unification. Unification is concerned with the problem of identifying given terms, either syntactically or modulo a given logical theory. Syntactic unification is the basic operation of most automated reasoning systems, and unification modulo theories can be used, for instance, to build in special equational theories into theorem provers
International audienceA critical question in unification theory is how to obtain a unification algor...
We investigate the unification problemin theories defined by rewrite systems which are both converge...
UNIF 2020, part of "Paris Nord Summer of LoVe 2020", a joint event on LOgic and VErification at Univ...
Proceedings of the 19th international workshop on Unification, held during RDP'2005 in Nara, Japan, ...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
International audienceUnification in propositional logics is an active research area. In this paper,...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
AbstractMost knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic...
International audienceIn this paper, we show that every KD45-unifiable formula has a projective unif...
The unification problem and several variants are presented. Various algorithms and data structures a...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
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...
Unification is a fundamental process upon which many methods for automated deduction are based. Uni...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
International audienceA critical question in unification theory is how to obtain a unification algor...
We investigate the unification problemin theories defined by rewrite systems which are both converge...
UNIF 2020, part of "Paris Nord Summer of LoVe 2020", a joint event on LOgic and VErification at Univ...
Proceedings of the 19th international workshop on Unification, held during RDP'2005 in Nara, Japan, ...
The purpose of this paper is not to give an overview of the state of art in unification theory. It i...
International audienceUnification in propositional logics is an active research area. In this paper,...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
AbstractMost knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic...
International audienceIn this paper, we show that every KD45-unifiable formula has a projective unif...
The unification problem and several variants are presented. Various algorithms and data structures a...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
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...
Unification is a fundamental process upon which many methods for automated deduction are based. Uni...
Most of the work on the combination of unification algorithms for the union of disjoint equational t...
International audienceA critical question in unification theory is how to obtain a unification algor...
We investigate the unification problemin theories defined by rewrite systems which are both converge...
UNIF 2020, part of "Paris Nord Summer of LoVe 2020", a joint event on LOgic and VErification at Univ...