Professional Documents
Culture Documents
Artificial Intelligence - Knowledge Representation and Reasoning - Unit 8 - Week 5
Artificial Intelligence - Knowledge Representation and Reasoning - Unit 8 - Week 5
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
sateeshindian@gmail.com
If already
registered, click
to check your
Week 5 : Assignment
payment status The due date for submitting this assignment has passed.
Due on 2024-02-28, 23:59 IST.
Week 3 ()
We treat the words “proof” and “derivation” as synonyms.
Week 4 ()
IMPORTANT: Review Week 5 notes (PDFs under “Lecture Materials” link) before solving this
assignment.
Week 5 ()
Expert 1) Select the formulas that are in CNF. 1 point
Systems (unit?
unit=61&lesso A∧ B∧ C
n=62) A∨ B∨ C
Backward ¬A
Chaining (¬A ∨ B ∨ C) ∧ (¬C ∨ ¬D ∨ E)
Systems (unit?
¬(A ∨ B ∨ C) ∧ (C ∨ D ∨ E)
unit=61&lesso
n=63) Partially Correct.
Score: 0.75
Deductive Accepted Answers:
Retrieval (unit? A∧ B∧ C
unit=61&lesso
A∨ B∨ C
n=64)
¬A
The Resolution (¬A ∨ B ∨ C) ∧ (¬C ∨ ¬D ∨ E)
Refutation
Method (unit? 2) Convert ∀x∀y{ ( A(x,y) ⊃ [B(x) ⊃ C(y)] ) ⊃ ( D(x) ⊃ [A(x,y) ⊃ C(y)] ) } to CNF. 1 point
unit=61&lesso
n=65) ∀x∀y[¬A(x,y) ∧ B(x) ∧ C(y) ∧ ¬D(x)]
Clause Form ∀x∀y{[C(y) ∨ ¬D(x)] ∧ [¬A(x,y) ∨ B(x) ∨ C(y) ∨ ¬D(x)] ∧ [¬A(x,y) ∨ ¬D(x)]}
in FOL (unit? ∀x∀y[¬A(x,y) ∨ B(x) ∨ C(y) ∨ ¬D(x)]
unit=61&lesso
∀x∀y[¬A(x,y) ∨ ¬B(x) ∨ C(y) ∨ D(x)]
n=66)
No, the answer is incorrect.
Resolution Score: 0
Refutation in
Accepted Answers:
FOL (unit? ∀x∀y[¬A(x,y) ∨ B(x) ∨ C(y) ∨ ¬D(x)]
unit=61&lesso
n=67)
3) Convert ∀x[(∃y(P(x) ⊃ R(x,y))) ⊃ (Q(x) ∧ ∃z R(x,z))] to Skolem form. 1 point
First Order
Logic with ∀x∀y[(P(x) ⊃ R(x,y)) ⊃ (Q(x) ∧ R(x,sk(x)))]
Equality (unit? ∀x[(P(x) ⊃ R(x,sk(x))) ⊃ (Q(x) ∧ R(x,sk(x)))]
unit=61&lesso
∀x∀y[(P(x) ∧ ¬R(x,y)) ∨ (Q(x) ∧ R(x,sk(x)))]
n=68)
∀x[(P(x) ∧ ¬R(x,sk(x))) ∨ (Q(x) ∧ R(x,sk(x)))]
Who was the
surgeon? No, the answer is incorrect.
(unit?
Score: 0
unit=61&lesso Accepted Answers:
n=69) ∀x∀y[(P(x) ⊃ R(x,y)) ⊃ (Q(x) ∧ R(x,sk(x)))]
∀x∀y[(P(x) ∧ ¬R(x,y)) ∨ (Q(x) ∧ R(x,sk(x)))]
Consistency
vs.
4) Convert ∀x[(∃y(P(x) ⊃ R(x,y))) ⊃ (Q(x) ∧ ∃z R(x,z))] to clause form. 1 point
Completeness
(unit?
[P(?t) ∨ Q(?t)] ∧ [P(?w) ∨ R(?w,sk(?w))] ∧ [¬R(?x,?y) ∨ Q(?x)] ∧ [¬R(?u,?v) ∨ R(?u,sk(?
unit=61&lesso
u))]
n=70)
[P(?t) ∨ Q(?t)] ∧ [P(?w) ∨ R(?w,sk(?w))] ∧ [¬R(?x,sk(?x)) ∨ Q(?x)] ∧ [¬R(?u,sk(?u)) ∨ R(?
Lecture
u,sk(?u))]
material (unit?
unit=61&lesso { {P(?t) Q(?t)}; {P(?w), R(?w,sk(?w))}; {¬R(?x,?y), Q(?x)}; {¬R(?u,?v), R(?u,sk(?u))} }
n=71) { {P(?t), Q(?t)}; {P(?w), R(?w,sk(?w))}; {¬R(?x,sk(?x)), Q(?x)}; {¬R(?u,sk(?u)), R(?u,sk(?
u))} }
Week 5
Feedback form None of the above
: Artificial
P i ll C
Intelligence: Partially Correct.
Knowledge Score: 0.5
Representatio Accepted Answers:
n And [P(?t) ∨ Q(?t)] ∧ [P(?w) ∨ R(?w,sk(?w))] ∧ [¬R(?x,?y) ∨ Q(?x)] ∧ [¬R(?u,?v) ∨ R(?u,sk(?u))]
Reasoning { {P(?t) Q(?t)}; {P(?w), R(?w,sk(?w))}; {¬R(?x,?y), Q(?x)}; {¬R(?u,?v), R(?u,sk(?u))} }
(unit?
5) Consider the following pair of clauses with predicates Q, R; functions f, g; variables 1 point
unit=61&lesso
n=72) x, y; and constants a, b.
1. { R(f(a), g(b)) }
Practice: Week 2. { ¬R(?x, ?y); ¬R(f(?x), g(?y)); Q(f(?x)); }
5 : Assignment
Which of the following are unifiers for the pair of clauses?
(Non Graded)
(assessment?
{ x -> a; y -> b }
name=197)
{ x -> f(a); y -> b }
Quiz: Week 5
{ x -> f(a); y -> g(b) }
: Assignment
(assessment? None of the above because clauses with multiple unifiers cannot be unified.
name=217) Partially Correct.
Score: 0.5
Week 6 () Accepted Answers:
{ x -> a; y -> b }
Week 7 () { x -> f(a); y -> g(b) }
Week 8 () 6) For the pair of clauses in the previous question, select the most general unifier. 1 point
Problem ¬A ∨ ¬B ∨ C
Solving
B ∨ ¬P ∨ ¬Q
Session -
Jan 2024 () ¬B ∨ Q
C ∨ ¬P ∨ ¬Q
C ∨ ¬Q
9) Does KB1 entail (B ∧ C ∧ P ∧ Q)? Use the Resolution Refutation Method to 1 point
prove/disprove it.
Yes
No
Cannot be determined
10) A KB is given in clause form with predicates A, B, P, Q, R, S; constants Foo, Bar; 1 point
and variables prefixed with ‘?’.
KB2 = {
1. ¬A(?x) ∨ S(?x);
2. ¬B(?u) ∨ R(?u,?v);
3. ¬P(?y,?z) ∨ Q(?y,?z);
4. ¬S(?t) ∨ B(?t) ∨ P(?t,?w);
5. A(Foo);
6. B(Foo);
}
Which of these sentences follow from KB2. Use the Resolution Refutation Method to prove it.
S(Foo) ∧ S(Bar)
R(Foo,Bar) ∨ Q(Foo,Bar)
∃t∃x∃y (R(t,x) ∨ Q(t,y))
∃t∃x∃y (R(t,x) ∧ Q(t,y))
11) Can the Resolution Refutation Method be used to prove that KB2 entails the 1 point
following statement?
Yes
No
N h i i
No, the answer is incorrect.
Score: 0
Accepted Answers:
Yes