Quiz Space

AI: Search Methods for Problem Solving · End Term · 30 Apr 2023 · January 2023 term

Question 17: RULE BASED EXPERT SYSTEMS\ A Rete Net for classification…

Question 17

+1 markOne or more correct options

RULE BASED EXPERT SYSTEMS
A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ..., A10, A11, A12, A13, ..., and B1, B2, B3 uniquely identify nodes in the network. When required, use the above label ordering to break ties and to enter short answers.

RULE BASED EXPERT SYSTEMS
A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ..., A10, A11, A12, A13, ..., and B1, B2, B3 uniquely identify 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.

RULE BASED EXPERT SYSTEMS
A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ..., A10, A11, A12, A13, ..., and B1, B2, B3 uniquely identify 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.
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.

Which of the following rule-data tuples are in the conflict-set?

Select all that apply.

  1. A

    F1-Car,104,107,109

  2. B

    Luxury-Car,103,106,108

  3. C

    Truck,101,102,105

  4. D

    Truck,101,103,106

Show answer

Correct answers

  • A

    F1-Car,104,107,109

  • B

    Luxury-Car,103,106,108

  • C

    Truck,101,102,105

See the whole paperTake it as a mock test

Question 17 of 21 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 30 Apr 2023, in the January 2023 term (IIT M DEGREE ET1 EXAM QPE2 S1 30 Apr 2023). It carries 1 mark.

More questions from this paper

  1. Q1SEARCH\ A MoveGen for a state space where S is the start node and G is the goal node is shown in the table. The MoveGen…
  2. Q2TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  3. Q3TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  4. Q4TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  5. Q5TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  6. Q6TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  7. Q7SEARCH FOR OPTIMAL SOLUTION\ The figure shows a map on a uniform grid where each tile is 10x10 in size. The start node …
  8. Q8SEARCH FOR OPTIMAL SOLUTION\ The figure shows a map on a uniform grid where each tile is 10x10 in size. The start node …
  9. Q9SEARCH FOR OPTIMAL SOLUTION\ The figure shows a map on a uniform grid where each tile is 10x10 in size. The start node …
  10. Q10GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  11. Q11GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  12. Q12GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  13. Q13GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  14. Q14PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  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. Q18RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ...…
  18. Q19RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ...…
  19. Q20CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  20. Q21CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…