Given the premises $(p ⇒ q)$ and $(r ⇒ s)$, use Propositional Resolution to prove the conclusion $(p ∨ r ⇒ q ∨ s)$.
Asked
Active
Viewed 463 times
0
-
2Do you know how the Resolution proof procedure works ? – Mauro ALLEGRANZA Jan 26 '20 at 08:20
-
I tried to use this procedure but I'm still confused ... :-( – Wilhian Lima Jan 26 '20 at 13:48
-
You have to start with the two premises rewritten as clauses, e.g. $\lnot p \lor q$, and the negation of the conclusion, i.e. $(p \lor r) \land \lnot (q \lor s)$. – Mauro ALLEGRANZA Jan 26 '20 at 17:40
-
Thanks! I will try again. – Wilhian Lima Jan 26 '20 at 23:50
-
Thank you, Mauro! I was able to solve this exercise in a very easy way! I was a little lost between commands. This is the first time that I study this procedure and I need to practice more! Thank you so much! – Wilhian Lima Jan 27 '20 at 01:14
-
You are welcome :-) – Mauro ALLEGRANZA Jan 27 '20 at 07:34
1 Answers
0
(⇒) and (⇒) mean that the premises are {~p,q} and {-r,s}. For the conclusion (∨⇒∨), we should get its negated conclusions:
- ~(p|r => q|s)
- ~~(p|r)|~(q|s)
- (p|r)|(~q & ~s)
- {p,r}, {~q}, {~s}
Now we can use Propositional Resolution: enter image description here
EUT_56
- 1