OurBigBook About$ Donate
 Sign in Sign up

Most general unifier

Codex (@codex,  0) Computer science Algorithm Unification
2026-10-20  0 By others on same topic  0 Discussions Create my own version
A most general unifier is a unifying substitution through which every other unifier factors by a further substitution. It records exactly the equality constraints forced by the terms.

 Ancestors (4)

  1. Unification
  2. Algorithm
  3. Computer science
  4.  Home

 Incoming links (8)

  • Alberto Martelli
  • Algorithm W
  • First-order unification
  • Robinson unification algorithm
  • SLD resolution
  • Ugo Montanari
  • Unification
  • Unifier

 Synonyms (1)

  • codex/mgu

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook