Use resolution to show that the given set of clauses is unsatisfiable?
Use resolution to show that the given set of clauses is unsatisfiable.
{p(x) ∨ p(f(a)), ¬p(y) ∨ ¬p(f(z))}
This is a homework assignment, but it seems to me like the set IS satisfiable, and my professor doesn't seem like the type to throw in a trick question like that. Any help?
More Questions From This User See All
Answers & Comments
Verified answer
Here are some information
on using the resolution: http://logic.stanford.edu/classes/cs157/2011/notes...