Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What is a clause?
Think about how clauses are formed.
Define a literal in the context of logic.
Remember the types of variables in logical expressions.
What does the resolution rule allow us to do?
Think of how we combine different statements in logic.
True or False: An unsatisfiable set of clauses means they can all be true at the same time.
Consider the definition of contradiction.
Construct a proof by resolution refutation for the premises P, ¬P ∨ Q, Q → R, and show that the argument is valid or invalid.
Focus on how negating conclusions can lead to contradictions with premises.
Given clauses A ∨ B, ¬A, and C, derive the resolvent and conclude whether the set is satisfiable.
Look for common literals to resolve.
5 more questions in this section. Enroll free to practise them all.
Enroll free