Go up to Top
Go forward to Question 2

Question 1

Given the knowledge base KB containing the clauses:

a<- b &  c.
b<- d.
b<- e.
c.
d<- h.
e.
f<- g &  b.
g<- c &  k.
j<- a &  b.

Show how the bottom-up proof procedure works for this example. Show at each step what element is added to C. Give all logical consequences of KB.
f isn't a logical consequence of KB. Explain what this means. Give a model of KB in which f is false.
a is a logical consequence of KB. Explain what this means. Give a top-down derivation for the query ?a.