Question: 1 Propositional Logic 1 5 + 1 5 = 3 0 Consider the following propositional logic sentences: phi 1 = A - > (
Propositional Logic
Consider the following propositional logic sentences:
phi A A BB C
phi A BB CC A A
A BA CB D
Relative to these sentences,
a Show clearly whether they are either valid, satisfiable but not valid or unsatisfiable;
in each case, justify your answer.
b Convert them into Conjunctive Normal Form CNF and indicate if they are the Horn Clause. BackwardForward Reasoning
Convert the expressions below into propositional logic sentences:
If a person is likely to vomit and looks pale and is thirsty, then is sick.
Always, a person does not have a high temperature or has slept well or is thirsty.
If a person does not look pale, then feels well or has slept well.
If a person has a fever, then their temperature is high.
It is known that when a person looks pale, then they should drink water.
If a person has a high temperature and does not feel well, then is likely to vomit.
It is always the case that a person does not feel well or does not have a fever.
If a person has slept well, then is not exhausted.
With the propositional logic sentences obtained from the above expressions in English, show
whether or not it can be proved that a person is sick if one assumes both that the person
has a fever and that the person is exhausted. Do this reasoning using:
a Forward chaining; and show the graph resulting from the application of the rules.
Provide a table showing which variables are in your AGENDA, are INFERRED, and
their COUNT throughout the application of the algorithm.
b Backward chaining; and provide a sequence of rules to prove the goal.
S : is Sick
V: likely to Vomit
P: looks Pale
T: is Thirsty
H: has High temperature
NS: has Not Slept well
NF: does Not Feel well
F: has Fever
W: drink Water
E: is Exhausted mgumost general unifierthe mgu g of has the property that if is any unifier of
yielding Ei
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
