Explanation: For every unifiable pair of expressions, a single most general unifier is unique up to renaming of variables. 6. Which makes the complexity of the entire algorithm quadratic in the size?
A. Clause
B. Inference
C. Resolution
D. Occur check
Answer:A
Explanation: For every unifiable pair of expressions, a single most general unifier is unique up to renaming of variables. 6. Which makes the complexity of the entire algorithm quadratic in the size?
A. Clause B. Inference C. Resolution D. Occur check
Explanation: Occur check makes the complexity of the entire algorithm quadratic in the size of the expressions being unified. 7. How many functions are available in the unification and lifting process?