Question

What is the problem with unification with consistent substitution?

Answer 1

In logic and computer science, unification is an algorithmic process of solving equations. A solution of a unification problem is denoted as a substitution, that is, a mapping assigning a symbolic value to avoid variable name clashes, rewrite rules are consistently renamed each time before their use by rule mutate.