Inference in first-order logic

3 Mar 2004

CS3243 - Inference

Hard matching example

lColorable() is inferred iff the CSP has a solution

lCSPs include 3SAT as a special case, hence matching is NP-hard

Diff(wa,nt) Ù Diff(wa,sa) Ù Diff(nt,q) Ù Diff(nt,sa) Ù Diff(q,nsw) Ù Diff(q,sa) Ù Diff(nsw,v) Ù Diff(nsw,sa) Ù Diff(v,sa) Þ Colorable()

Diff(Red,Blue) Diff (Red,Green) Diff(Green,Red) Diff(Green,Blue) Diff(Blue,Red) Diff(Blue,Green)