Quiz Space

AI: Search Methods for Problem Solving · End Term · 21 Dec 2025 · September 2025 term

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

Question 31

+1 markWritten answer

RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. 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.

The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to WMEs in the Alpha nodes.

For each WME identify its location (node label) in the Rete Net, then prepare the conflict set for the first Match-Resolve-Execute cycle, then answer the sub-questions.

RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10
RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10
Show answer

A written answer, not marked automatically.

See the whole paperTake it as a mock test

Question 31 of 34 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 21 Dec 2025, in the September 2025 term (Ai: Search Methods For Problem Solving 18 Dec 25). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  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 i…
  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 i…
  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 i…
  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 i…
  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 i…
  7. Q7Determine the eval of node N that will induce a cutoff to prune its siblings. Enter an even number. NO SPACES, TABS, DO…
  8. Q8What type of cut-off is induced by the eval selected for N?
  9. Q9GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  10. Q10GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  11. Q11PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  12. Q12PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  13. Q13PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  14. Q14RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  15. Q15RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  16. Q16RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  17. Q17Consider actions a and b and two feasible orderings (a then b) and (b then a). Which of the following conditions will p…
  18. Q18In planning graphs constructed by GraphPlan, actions a and b in layer n are mutex .
  19. Q19In planning graphs constructed by GraphPlan, propositions P and Q in layer n are mutex .
  20. Q20AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  21. Q21AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  22. Q22AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  23. Q23AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  24. Q24CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …
  25. Q25CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …
  26. Q26CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …
  27. Q27SEARCH 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 i…
  28. Q28GAMES: ALPHA-BETA Consider a game tree with the root node as MAX. Alpha-Beta algorithm is in mid-flight currently proce…
  29. Q29GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  30. Q30PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  31. Q32AUTOMATED PLANNING 1 Answer the given subquestions.
  32. Q33AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  33. Q34CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …