Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
79 views2 pages

Ex Ai en 6

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
79 views2 pages

Ex Ai en 6

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

HOMEWORK 6

Propositional Logic (PL)


1. Transform the following formulas into conjunctive normal form (CNF)

(a) A ⇐⇒ B
(b) A ∧ B ⇐⇒ A ∨ B
(c) A ∧ (A =⇒ B) =⇒ B

2. Given a knowledge base as follows

KB = {A ∧ B =⇒ C, D ∧ E =⇒ B, F =⇒ A, E =⇒ A, E, D}

Prove that the sentence C is entailed by KB by using

(a) Forward chaining


(b) Backward chaining

3. If the criminal had an accomplice, then he came in a car. The criminal had no accomplice
and did not have the key, or he had the key and an accomplice. The criminal had the key.
Using a resolution inference to answer the question “Did the criminal come in a car?”

First-Order Logic (FOL)


4. For each English sentence below, write the FOL sentence that best expresses its intended
meaning using the following predicates Cat(x) for “x is a cat,” Mouse(x) for “x is a mouse,”
and Chases(x, y) for “x chases y.”

(a) Every cat chases every mouse.


(b) For every cat, there is a mouse that the cat chases.

1
(c) There is a cat who chases every mouse.
(d) Some cat chases some mouse.
(e) There is a mouse that every cat chases.
(f) For every mouse, there is a cat who chases that mouse.

5. Given English sentences as follows

• Every child loves Santa.


• Everyone who loves Santa loves any reindeer.
• Rudolph is a reindeer, and Rudolph has a red nose.
• Anything which has a red nose is weird or is a clown.
• No reindeer is a clown.
• Scrooge does not love anything which is weird.

(a) Build a FOL knowledge base from the above sentences, using only the following predi-
cates.
Child(x): “x is a child”, Loves(x, y): “x loves y”
Reindeer(x): “x is a reindeer”, RedNose(x): “x has red nose”
Weird(x): “x is weird”, Clown(x): “x is a clown”
(b) Convert each FOL sentece in the knowledge base into CNF
(c) Use resolution to prove that “Scrooge is not a child.”

You might also like