This is Artificial Intelligence class. Apply Logical Connectives; and(^), or(v),

Question

This is Artificial Intelligence class.

Apply Logical Connectives; and(^), or(v), not(~), implication, biconditional, and inference rules(modus ponens, and-elimination)

A. (4 points) Construct a knowledge base KB consisting of the following sentences in propositional logic: If the unicorn is mythical, then it is immortal, but if it is not mythical, then it is a mortal mammal. If the unicorn is either immortal or a mammal, then it is horned. The unicorn is magical if it is horned. Prove or disprove the following, each using two methods: (i) By constructing a truth table (1 point), and (ii) By using the logical equivalence and inference rules (1 point). B. (1+1_2 points) The unicorn is mythical. C. (1+13:2 points) The unicorn is magical. D. (1+1-2 points) The unicorn is horned.

Explanation / Answer

A.The elements of the knowledge base :

Unicorn_isMythical   = the Unicorn is mythical
Unicorn_isMortal = the unicorn is mortal
Unicorn_isMammal = the unicorn is a mammal
Unicorn_hasHorn = the unicorn is horned
Unicorn_isMagical = the unicorn is magical

We will get the clause:

1.Unicorn_isMythical -> ~Unicorn_isMortal
2.~Unicorn_isMythical -> (Unicorn_isMortal ^ Unicorn_isMammal)
3.(~Unicorn_isMortal v Unicorn_isMammal) -> Unicorn_hasHorn
4.Unicorn_hasHorn -> Unicorn_isMagical

B.Truth Table for Unicorn is Mythical

C.Truth Table for Unicorn is Magical

D.In above part answer is already given

Truth Table for Unicorn is Mythical Unicorn_isMythical ~Unicorn_isMythical Unicorn_isMortal T F F F T T

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.