Suggested tasks/exercises

1. week

Describe your favorite AI related lecture (“podcast”) in 1 page (max. 2500characters).

For example, AI related lectures are available here:

2. week

Suggested reading:

Solving problems by searching: 3.1, 3.4, 3.4

Informed search and Exploration: 4.1, 4.2

Suggest an admissible heuristic function for graph edit distance.

5. week

Solve this puzzle using the truth table method:

Adam, Betty, and Chris played and a window got broken.  Adam says: ‘Betty made, Chris is innocent.'

Betty says: ‘If Adam is guilty, then Chris too'.  Chris says: ‘I am innocent; someone else did it'.

Is it possible that none of them is lying? If they are telling the truth, who broke the window? In the truth table method use the following notation:

A:      Adam is innocent.

            B:      Betty is innocent.

            C:      Chris is innocent.

Suggested reading: Ch: 7.1, 7.3, 7.4, 7.5

6. week

Prove a syllogism using resolution.

Suggested reading: Ch:8.2,9.1,10.1,10.2,10.6

© 2010-2024 BME MIT