Resolution Algorithm - No new clauses

cs.stackexchange https://cs.stackexchange.com/questions/91244

Question

Resolution algorithm from AIMA pg 255

The standard resolution algorithm returns false if no new clauses are added.

I know that if $KB \land \neg a \implies []$, it returns true by proof by contradiction, but how can I understand the false case intuitively?

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange
scroll top