CS 236501 Introduction To AI: Tutorial 8 Resolution
CS 236501 Introduction To AI: Tutorial 8 Resolution
CS 236501 Introduction To AI: Tutorial 8 Resolution
Introduction to AI
Tutorial 8
Resolution
Problem Definition
Input
1. Database containing formally represented facts: First-order
logic sentences converted into clause form.
2. Inference rule: Resolution principle (MP & MT)
Requirements:
1. Soundness – every sentence produced by the procedure will
be “true”.
2. Completeness – every “true” sentence can be produced by the
procedure
• We can conclude:
– (Φ – {φ}) U (Ψ – {¬φ})
• We can conclude:
– ((Φ – {φ}) U (Ψ – {¬ψ})) | g
Intuition
• If all DB sentences are true, and assuming ¬C
creates a contradiction then C must be inferred from
DB.
•
2. Distribute negations:
– Replace ¬¬A with A
– A B withA B
– …
• Remove implications:
y on x, y bigger y , x
x brick x y on y, x brick y
y, z on x, y on x, z equal y, z
• Rename variables:
on x,support x bigger support x , x
x brick x y on y, x brick y
w, z on x, w on x, z equal w, z
• Convert to CNF:
brick x on x,support x
brick x bigger support x , x
brick x on y, x brick y
brick x on x, w on x, z equal w, z
• Convert to clauses:
brick x , on x,support x ,
brick x , bigger support x , x ,
brick x , on y, x , brick y ,
brick x , on x, w , on x, z , equal w, z
• Facts representation:
1. H Win Me
2. T Loose You
3. H T
4. Loose You Win Me
Goal : Win Me
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: