Q10 Given the following representation of a search problem, where A is the start node and...

 

Transcribed Image Text:

Q10 Given the following representation of a search problem, where A is the start node and G is the goal. There is also a heuristics h which is defined in the table. We do not know h(B). Find the values of h(B) that make h admissible. Explain your answer B 2 F For the following knowledge base a-b^c. a g. b-j^a. c←f. g+f^p. k-j. 3 5 (0) E (ii) 3 a+c^k. d-m^j. k+b^p. (a) Give one non-trivial model (b) Give a non-trivial interpretation which is not a model of the knowledge base (c) Two doctors independently diagnosed the same patient M1(a) = 0.99, m1(b)= 0.01 M2(c) = 0.99, m2(b) = 0.01 b-g^j. d-p^a. Q11 (a) What are the benefits of applying the belief function theory over the classical probability theory? (b) Define the following terms: a. Frame of discernment b. Belief function c. Plausibility function d. Commonality function m. 11 h(n) A 5 B ? 4 D 3 E 3 F 1 0 lule 1410 G b-k. fem. P. Apply Dempster -Shafer theory to find the most "believed" diagnosis an agent would decide. Criticize the answer. Q10 Given the following representation of a search problem, where A is the start node and G is the goal. There is also a heuristics h which is defined in the table. We do not know h(B). Find the values of h(B) that make h admissible. Explain your answer B 2 F For the following knowledge base a-b^c. a g. b-j^a. c←f. g+f^p. k-j. 3 5 (0) E (ii) 3 a+c^k. d-m^j. k+b^p. (a) Give one non-trivial model (b) Give a non-trivial interpretation which is not a model of the knowledge base (c) Two doctors independently diagnosed the same patient M1(a) = 0.99, m1(b)= 0.01 M2(c) = 0.99, m2(b) = 0.01 b-g^j. d-p^a. Q11 (a) What are the benefits of applying the belief function theory over the classical probability theory? (b) Define the following terms: a. Frame of discernment b. Belief function c. Plausibility function d. Commonality function m. 11 h(n) A 5 B ? 4 D 3 E 3 F 1 0 lule 1410 G b-k. fem. P. Apply Dempster -Shafer theory to find the most "believed" diagnosis an agent would decide. Criticize the answer.

Answer rating: 100% (QA)

The question provided is split into three parts Ill address each one individually For the given search problem shown in the image the heuristic function hB must be admissible That means it should neve... View the full answer