Explanation: Lifted inference rules require finding substitutions that make different logical expression looks identical. This process is called unification.	3. Which algorithm takes two sentences and returns a unifier?
A. Inference
B. Hill-climbing search
C. Depth-first search
D. Unify algorithm
Answer:A
Explanation: Lifted inference rules require finding substitutions that make different logical expression looks identical. This process is called unification.	3. Which algorithm takes two sentences and returns a unifier?
A. Inference B. Hill-climbing search C. Depth-first search D. Unify algorithm
Explanation: The unify algorithm takes two sentences and returns a unifier if there is one in the sentence. 4. Which is a lifted version of modus ponens?