Scribd
Upload
45 views

AI - Assignment 4 - Spring2023

The document outlines an assignment on propositional logic and reasoning. It contains 4 problems - the first involves determining the validity of logical statements using truth tables, the second involves determining the validity, unsatisfiability or neither for logical statements using equivalence rules, the third involves converting logical statements to conjunctive normal form and using resolution to prove validity, and the fourth involves representing a Wumpus world scenario as a knowledge base and using resolution and inference rules to prove statements about the world.

Uploaded by

Sami Ahmed
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
45 views

AI - Assignment 4 - Spring2023

The document outlines an assignment on propositional logic and reasoning. It contains 4 problems - the first involves determining the validity of logical statements using truth tables, the second involves determining the validity, unsatisfiability or neither for logical statements using equivalence rules, the third involves converting logical statements to conjunctive normal form and using resolution to prove validity, and the fourth involves representing a Wumpus world scenario as a knowledge base and using resolution and inference rules to prove statements about the world.

Uploaded by

Sami Ahmed
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

National University

of Computer and Emerging Sciences, CFD Campus

AI 2002 - Artificial Intelligence (Spring 2023)


Assignment # 4

Topics Covered: Propositional Logic and Submission Deadline: April 17, 2023, by
Reasoning 16.00 sharp

Only hand-written solutions will be accepted.


Submit hand-written solutions to your
instructor’s office.

Problem # 1: [Propositional logic + model enumeration]


Which of the following are correct? Validate your answers using truth-table.
a. False |= True.
b. True |= False.
c. (A ∧ B) |= (A ⇔ B).
d. A ⇔ B |= A ∨ B.
e. A ⇔ B |= ￢A ∨ B.
f. (A ∧ B) ⇒ C |= (A ⇒ C) ∨ (B ⇒ C).
g. (C ∨ (￢A ∧ ￢B)) ≡ ((A ⇒ C) ∧ (B ⇒ C)).
h. (A ∨ B) ∧ (￢C ∨￢D ∨ E) |= (A ∨ B).
i. (A ∨ B) ∧ (￢C ∨￢D ∨ E) |= (A ∨ B) ∧ (￢D ∨ E).
j. (A ∨ B) ∧ ￢(A ⇒ B) is satisfiable.
k. (A ⇔ B) ∧ (￢A ∨ B) is satisfiable.
l. (A ⇔ B) ⇔ C has the same number of models as (A ⇔ B) for any fixed set of proposition
symbols that includes A, B, C.

Problem # 2: [Propositional logic + inference rules]


Decide whether each of the following sentences is valid, unsatisfiable, or neither. Verify your
answers using the equivalence rules.
a. Smoke ⇒ Smoke
b. Smoke ⇒ Fire
c. (Smoke ⇒ Fire) ⇒ (￢Smoke ⇒ ￢Fire)
d. Smoke ∨ Fire ∨ ￢Fire
e. ((Smoke ∧ Heat ) ⇒ Fire) ⇔ ((Smoke ⇒ Fire) ∨ (Heat ⇒ Fire))
f. (Smoke ⇒ Fire) ⇒ ((Smoke ∧ Heat ) ⇒ Fire)
g. Big ∨ Dumb ∨ (Big ⇒ Dumb)

Page 1
National University
of Computer and Emerging Sciences, CFD Campus

Problem # 3: [Propositional logic + CNF + proof by resolution]


Consider the following sentence:
[(Food ⇒ Party) ∨ (Drinks ⇒ Party)] ⇒ [(Food ∧ Drinks) ⇒ Party]

a. Determine, using enumeration, whether this sentence is valid, satisfiable (but not valid),
or unsatisfiable.
b. Convert the left-hand and right-hand sides of the main implication into Conjunctive
Normal Form (CNF), showing each step, and explain how the results confirm your answer
to (a).
c. Prove your answer to (a) using resolution.

Problem # 4: [Wumpus world + entailment]


Suppose the agent has progressed to the point shown in the figure below, having perceived
nothing in [1,1], a breeze in [2,1], and a stench in [1,2], and is now concerned with the contents
of [1,3], [2,2], and [3,1]. Each of these can contain a pit, and at most one can contain a wumpus.

a. Create a knowledge base to represent the necessary environment rules and agent’s
observations.
b. Prove that KB |= α1 using resolution theorem where α1 = “There is no pit in [2,2].”
c. Prove that KB |= α2 using inference rules where α2 = “There is a wumpus in [1,3].”

Page 2

You might also like