Resolution as Search through a Search Space
- Resolution can be thought of as the bottom-up construction of a
search tree, where the leaves are the clauses produced by KB and
the negation of the goal. When a pair of clauses generates a
new resolvent clause, add a new node to the tree with arcs directed
from the resolvent to the two parent clauses. Resolution succeeds
when a node
containing the False clause is produced, becoming the root node
of the tree.
- A strategy is complete if its use guarantees that the empty
clause (i.e., false) can be derived whenever it is entailed.
- Some Strategies for Controlling Resolution's Search
- Breadth-First
- Level 0 clauses are those from the original axioms and the
negation of the goal. Level k clauses are the resolvents computed
from two clauses, one of which must be from level k-1 and the other
from any earlier level.
- Compute all level 1 clauses possible, then all possible level 2
clauses, etc.
- It's complete, but very inefficient.
- Set-of-Support
- At least one parent clause must be from the negation of the goal
or one of the "descendents" of such a goal clause (i.e., derived from
a goal clause).
- It's complete (assuming all possible set-of-support clauses are derived).
- Unit Resolution
- At least one parent clause must be a "unit clause," i.e.,
a clause containing a single literal.
- This is not complete in general, but complete for Horn clause KBs.
- Input Resolution
- At least one parent from the set of original clauses (from the
axioms and the negation of the goal).
- This is not complete in general.