#pattern-matching

Question 1: Single choice

A rule-based system runs the Match–Resolve–Execute cycle. Which phase is the most expensive, and how does the Rete algorithm reduce its cost?

Matching; Rete keeps partial matches from cycle to cycle and updates them as WMEs change1
Conflict resolution; Rete sorts the conflict set faster by keeping it in a priority queue2
Execution; Rete compiles rule actions into machine code before running them3
Matching; Rete re-matches every rule against all of working memory in parallel4