CLO1 (Course Learning Outcome 1) -- Find solution nodes in a state space using the A* algorithm.

CLO2 -- Explain the advantages and disadvantages of the following techniques: (a) breadth-first search compared to depth-first search, (b) informed search compared to uninformed search, hill climbing, STRIPS/PDDL representations for planning.

CLO3 -- Apply forward checking in constraint satisfaction problems.

CLO4 -- Apply alpha-beta pruning in adversarial search.

CLO5 -- Translate sentences in first-order logic to conjunctive normal form (CNF).

CLO6 -- Find proofs by using resolution.

CLO7 -- Implement at least one machine learning algorithm.

CLO8 -- Students should be able to describe: (a) the frame problem, (b) Possible representations for time and for beliefs.

N/A -- Important material covered in the course but not directly related to a specific learning outcome.