Practice Example Of Argument Validation (5.10) - Resolution - Discrete Mathematics

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 what a clause is in propositional logic.
Show hintHide hint
Think about how literals combine to form more complex expressions.
Question 2.
What is the resolution rule used for?
Show hintHide hint
Consider how it helps in logic-based systems.
3Question 3.
What does the resolution rule allow you to do?
- Form new clauses
- Reject old clauses
- Add literals
Show hintHide hint
Consider how clauses interact with each other.
4Question 4.
True or False: The empty clause indicates that a set of clauses is satisfiable.
- True
- False
Show hintHide hint
Think about what inconsistency implies.
Question 5.
Given premises (A → B), (C → D), (¬A), (C), and the conclusion (B), show through resolution refutation that it is valid.
Show hintHide hint
Follow the paths of resolution through the premises carefully.
Question 6.
Construct a resolution tree for the clauses: (A ∨ B), (¬A ∨ C), (¬B ∨ D), (¬C) and determine if the empty clause is present.
Show hintHide hint
Identify the steps leading towards the contradictions.

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