# Unification (computer science)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- Software & Systems Modeling
- 2005

In November 2000, the OMG made public the MDAâ„¢initiative, a particular variant of a new global trend called MDE (Model Drivenâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- J. Symb. Comput.
- 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

- Math. Program.
- 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

- J. Log. Comput.
- 1991

A meta programming language must be able to represent and manipulate such syntactic structures as programs, formulas, types, andâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- J. Symb. Comput.
- 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

- Theor. Comput. Sci.
- 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

- CSLI Lecture Notes
- 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

- J. Log. Program.
- 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)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- ACM Trans. Program. Lang. Syst.
- 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

- J. ACM
- 1981

An important component of automated theorem-proving systems are unification algorithms which fred most general substitutionsâ€¦Â (More)

Is this relevant?