Artificial intelligence

1. Write the function using informed search compare to uninformed search?

2. Given the following sentence representation, answer for A and F.
𝑄 = 𝐼 𝑤𝑖𝑙𝑙 𝑔𝑜 𝑡𝑜 𝑡𝑜𝑤𝑛
𝑅 = 𝐼 ℎ𝑎𝑣𝑒 𝑡𝑖𝑚𝑒
A. If it is not snowing and I have time, then I will go to town.
B. I will go to town only if I have time.
C. It is snowing, and I will not go to town.
D. I will go to town if I have time and if I have time, I will go to town
E. I have time and I will go to town.
3. Write the difference between syntax and semantic in knowledge representation
4. Change the following sentence to FOL representation
A. Some men are handsome.
B. Every baby has a mother that he cares.
C. Change question 4 B to CNF.
5. Check the categories of the following logical representation of sentence (whether they are
satisfiability, Contradiction and Tautology)
A. (p ∨ ¬q) ∨ (¬p ∧ ¬q)
B. (p ⇔q) ∧(¬p ∧ q)
6. Using inference rule approach show the following.
KB: 𝑝 𝑝⇒𝑞 (𝑝 ∧ 𝑞) ⇒ 𝑟 Theorem: r
7. List and clearly explain the quantifiers in FOL and write their syntax?
8. Show all possible transition states for the 8-puzzle problem given below depend on
Manhattan distance heuristic function.

2 3 6 2 3
6 8 4 1 4
1 7 5 7 8 5
Initial state Goal state

9. Depend on the searching graph given below, show all possible movement from the
staring node S to the goal state G using.
A. Greedy search
B. * search
 F Where the heuristic function
from each node to goal state
is given as follows:
8
E ℎ(𝑆) = 10.
ℎ(𝐵) = 8.
S G ℎ(𝐶) = 6.
ℎ(𝐷) = 5.

C 3 D ℎ(𝐸) = 1.
ℎ(𝐹) = 13

searching graph ℎ(𝐺) = 0.

Choice

1. Which one is true about the DeMorgan’s Laws

A. ¬ (P∧Q) ⇔ ¬P∨ Q C. ¬ (P∧ Q) ⇔ ¬P∧¬Q
B. ¬ (P∨ Q) ⇔ ¬P∧¬Q D. ¬ (P∨ Q) ⇔¬P∧Q
2.