Definition of Unification For First-order Logic
Let p and q be sentences in first-order logic.
- UNIFY(p,q) = U where subst(U,p) = subst(U,q)
Where subst(U,p) means the result of applying substitution U on the sentence p. Then U is called a unifier for p and q. The unification of p and q is the result of applying U to both of them.
Let L be a set of sentences, for example, L = {p,q}. A unifier U is called a most general unifier for L if, for all unifiers U' of L, there exists a substitution s such that applying s to the result of applying U to L gives the same result as applying U' to L:
- subst(U',L) = subst(s,subst(U,L)).
Read more about this topic: Unification (computer Science)
Famous quotes containing the words definition of, definition and/or logic:
“Definition of a classic: a book everyone is assumed to have read and often thinks they have.”
—Alan Bennett (b. 1934)
“One definition of man is “an intelligence served by organs.””
—Ralph Waldo Emerson (1803–1882)
“There is no morality by instinct.... There is no social salvation—in the end—without taking thought; without mastery of logic and application of logic to human experience.”
—Katharine Fullerton Gerould (1879–1944)