Question: ( 2 0 points ) Resolution A famous logic problem using the following propositional symbols to construct a KB : Y unicorn is mythical I

(20 points) Resolution A famous logic problem using the following propositional symbols to construct a KB :
Y "unicorn is mythical"
I "unicorn is immortal"
M "unicorn is mammal"
H "unicorn is horned"
G "unicorn is magical"
(a)(4 points) Translate English sentences to logic. Think of the paragraph as the following sentences:
(i) If the unicorn is mythical, then it is immortal.
(ii) If the unicorn is not mythical, then it is a mortal mammal.
(iii) If the unicorn is either immortal or a mammal, then it is horned.
(iv) If the unicorn is horned, then it is magical.
(b)(4 points) Convert (a) to KB in CNF.
(c)(6 points) Can you prove the unicorn is magical? Answer the question by adding the negation of the query to the KB and run resolution.
( 2 0 points ) Resolution A famous logic problem

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!