Dear Students,

This is an important notes about all tutorials :D

Tutorial 2:

• In state presentation you need to represent the state as symbols if the states are countable.

• In the state space diagram make sure to write the action in each arc to explain how you got this new state.

Tutorial 3:

• In DFS, BFS, IDS, and DLS we need to check the goal before inserting in the frontier.

• DFS and IDS use a stack while BFS uses a queue.

Tutorial 4:

• In Best First Search the value of H(n) is always zero for the goal node.

Tutorial 5:

• In CSP the problem formulation consist of Domain, constrain, and variables.

Tutorial 6:

• In using principle of proof by contradiction, to show that KB ╞ α, we show that (KB ⋀ ⌉ α ) is unsatisfiable.

• In Q1.b ⌉P12 ⋀ P12 yield an empty clause which is not equal to false.

Tutorial 7:

• Each constant symbol names exactly one object in a universe of discourse, but:

o not all objects have symbol names;

o some objects have several symbol names.

• Usually denoted with upper-case first letter.

o e.g. Wumpus, Ali.

Tutorial 8:

• In Q2: To prove that the animal is cheetah we need to prove Rule 9 and to prove it we need to prove Rule 5 OR Rule 6, in this case we will use Rule 5 first because it has smallest number if it is work OK otherwise we will try Rule 6.

Tutorial 9:

• A fact is always, unconditionally, true.

• A rule specifies a thing that is true if some condition is specified. It has:

o a condition part (right hand side of the rule).

o a conclusion part (left hand side of the rule).

GOOD LUCK ALL ;)