Quiz Space

AI: Search Methods for Problem Solving · End Term · 24 Dec 2023 · September 2023 term · Set FDB1

Question 20: RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that c…

Question 20

+1 markOne correct option

RULE BASED EXPERT SYSTEMS
A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the figure. The labels A1, A2, ..., A10, A16, ..., B1, B2, B3, R1, …, R4 uniquely identify the nodes in the network. When required, use the above label ordering to break ties and to enter short answers.

Run the Rete algorithm for the Working Memory shown below, the WMEs are in timestamp order. Assume that WMEs reside at appropriate Alpha nodes, and the Beta nodes point to WMEs residing in Alpha nodes.

text
101. (Cap ^specimen C36 ^colour RED ^surface SMOOTH)
102. (Cap ^specimen A25 ^colour WHITE ^surface SMOOTH)
103. (Mushroom ^specimen X16 ^odour NONE ^habitat LEAVES)
104. (Mushroom ^specimen A25 ^odour NONE ^habitat LEAVES)
105. (Stalk ^specimen C36 ^root BULBOUS ^ar-colour WHITE)
106. (Stalk ^specimen X16 ^br-surface SCALY ^ar-colour WHITE)
107. (Mushroom ^specimen C36 ^odour NONE ^sp-colour WHITE)
108. (Mushroom ^specimen B49 ^odour ALMOND ^sp-colour BROWN)
109. (Stalk ^specimen B49 ^br-surface SMOOTH)

For each WME identify its location (node label) in the Rete Net, and prepare the conflict set for the first cycle, then answer the given subquestions.

If the Inference Engine uses Recency as the conflict resolution strategy then which of the following rule-data tuples will qualify?.

  1. A

    R1,107

  2. B

    R2,102,104

  3. C

    R3,103,106

  4. D

    R4,101,105

  5. E

    R2,102,103

  6. F

    R3,104,106

Show answer

Correct answer

  • A

    R1,107

Question 20 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 24 Dec 2023, in the September 2023 term (IIT M DEGREE FN EXAM FDB1 24 Dec 2023). It carries 1 mark.

More questions from this paper

  1. Q1Printed graph sheets (hard copy) will be provided for registered candidates only. ASK FOR PRINTED GRAPH SHEETS 10 PAGES…
  2. Q2SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  3. Q3SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  4. Q4SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  5. Q5SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  6. Q6SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  7. Q7TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  8. Q8TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  9. Q9TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  10. Q10TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  11. Q11GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  12. Q12GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  13. Q13GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  14. Q14GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  15. Q15PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  16. Q16PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  17. Q17PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  18. Q18RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  19. Q19RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  20. Q21AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  21. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  22. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  24. Q25CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  25. Q26CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…