Unification (computer science)

Known as: Unification (computing), Syntactic unification, Unification 
In logic and computer science, unification is an algorithmic process of solving equations between symbolic expressions. Depending on which… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2019
020040019382018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
In November 2000, the OMG made public the MDA™initiative, a particular variant of a new global trend called MDE (Model Driven… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Unification problems are identified with conjunctions of equations between simply typed λ-terms where free variables in the… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
This paper shows, by means of an operator called a splitting operator, that the Douglas-Rachford splitting method for finding a… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A meta programming language must be able to represent and manipulate such syntactic structures as programs, formulas, types, and… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper, we reexamine the problem of general higher-order unification and develop an approach based on the method of… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This paper is concerned with E-unification in arbitrary equational theories. We extend the method of transformations on systems… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Well, someone can decide by themselves what they want to do and need to do but sometimes, that kind of person will need some… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
D The problem of unification of terms is log-space complete for P. In deriving this lower bound no use is made of the potentially… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An important component of automated theorem-proving systems are unification algorithms which fred most general substitutions… (More)
  • table I
Is this relevant?