Discussion
Which algorithm makes rule matching efficient in large systems?
Answer: C
Rete compiles the rule conditions into a network that stores partial matches, so only the consequences of a change are recomputed rather than every rule being retested. It trades memory for speed and made large production systems practical. A star, unification and resolution belong to search and to logical inference. The insight that working memory changes slowly between cycles is what the whole design exploits. Working one numerical case through both cases side by side fixes the distinction better than any rule of thumb.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development