Questions
1. Deduction Theorem
Given an expression, write a program to decide whether it's a theorem or not.
Steps:
1. Write a parser to isolate the clauses around the implication in the
expressions
Test Cases :
1. (P => Q ) => ((~Q => P) => Q)
2. P => (P V Q)
3. (P ^ Q) => (P V R)
2. Prolog Programing
Q. Write a program in Prolog to represent the following knowledge and find the answer to the given questions
a. Knowledge
A, B and C belong to Himalayan club. Every member in the club is either a mountain climber or skier or both. A likes whatever B dislikes and dislikes whatever B likes. A likes rain and snow. No mountain
climber likes rain. Every skiers likes snow
Question : Is there a member who is a mountain climber but not a skier?
