AI · Theory

Resolution in FOL

Theory

39/215

Resolution in FOL

Resolution proves by refutation: add the negated query, convert to CNF, resolve until empty clause (contradiction) or you give up. Works for PL and, with unification, FOL. Complete for FOL in theory, can be slow.

Viva sketch — to prove Q, assume ¬Q, derive □. Don’t write a 20-step CNF live unless they insist — explain the idea.

Output — idea / do / check for Resolution in FOL. Fill those three in the viva.

Exam tip

Refutation idea in three steps.

Example

# Resolution in FOL
print("idea :", "Resolution in FOL")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for Resolution in FOL. Fill those three in the viva.

Short notes

DefRefutation + CNF + resolve.
RuleEmpty clause = proved.

AI · Theory

Resolution in FOL

← All stacks

Theory

39/215

Resolution in FOL

Viva sketch — to prove Q, assume ¬Q, derive □. Don’t write a 20-step CNF live unless they insist — explain the idea.

Output — idea / do / check for Resolution in FOL. Fill those three in the viva.

Exam tip

Refutation idea in three steps.

Example

# Resolution in FOL
print("idea :", "Resolution in FOL")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for Resolution in FOL. Fill those three in the viva.

Short notes

DefRefutation + CNF + resolve.
RuleEmpty clause = proved.

Resolution in FOL

Example

Short notes

Questions

Resolution in FOL

Example

Short notes

Questions