Question: 4. Consider the knowledge base KB: a b c . b d . b e . c . d h
4. Consider the knowledge base KB:
a ← b ∧ c .
b ← d .
b ← e .
c .
d ← h .
e .
f ← g ∧ b .
g ← c ∧ k .
j ← a ∧ b .
(a) Show how the bottom-up proof procedure works for this example. Give all logical consequences of KB.
(b) f is not a logical consequence of KB. Give a model of KB in which f is false.
(c) a is a logical consequence of KB. Give a top-down derivation for the query ???????????? a.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
