1.

Which makes the complexity of the entire algorithm quadratic in the size?(a) Clause(b) Inference(c) Resolution(d) Occur checkThis question was addressed to me in an interview for internship.Origin of the question is Unification and Lifting in section Knowledge and Reasoning of Artificial Intelligence

Answer»

The correct option is (d) OCCUR CHECK

Easiest explanation: Occur check makes the complexity of the entire ALGORITHM quadratic in the SIZE of the EXPRESSIONS being unified.



Discussion

No Comment Found

Related InterviewSolutions