Question: Suppose propositional sentences and knowledge-base here. We have a knowledge-base called KB. KBPrime is defined as an union of (1) KB and (2) the negation
Suppose propositional sentences and knowledge-base here. We have a knowledge-base called KB. KBPrime is defined as an union of
(1) KB and (2) the negation of a propositional predicate P.
Answer true/false to the following questions.
Note that "|=" is used to denote entailment, and "|-" is used to denote derivation through resolution.
(a). (5 marks) If KB |= P, then KB |- P. That is, if KB entails P, then KB derives (using resolution) P.
(b). (5 marks) If KB |- P, then KB |= P.
(c). (5 marks) If KBPrime |- [], then KBPrime is not satisfiable.
(d). (5 marks) If KBPrime is not satisfiable, then KBPrime |- [].
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
