Practice Unsatisfiability Proof Via Resolution (7.7.1)

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define Functional Completeness.
Show hintHide hint
Think about what it means to be able to express all logical relationships.
Question 2.
What is a clause in logic?
Show hintHide hint
Consider how you might use clauses in logical expressions.
3Question 3.
What does functional completeness mean?
- Ability to represent all logical statements
- Ability to represent only simple statements
- Ability to represent temporal logic
Show hintHide hint
Think about logic as a complete system.
4Question 4.
True or False: All logical expressions can be transformed using a combination of negation and disjunction.
- True
- False
Show hintHide hint
Consider functional completeness again.
Question 5.
Demonstrate how the expression (p ∨ q), (¬p), and (¬q) leads to unsatisfiability using resolution.
Show hintHide hint
Track all resolutions carefully to find contradictions.
Question 6.
Construct a logical expression that uses only disjunction and negation, proving its functional completeness through resolution.
Show hintHide hint
Think about how to represent conjunction using the operators available.

4 more questions in this section. Enroll free to practise them all.