17 Mar 2005
CS 3243 - Logical Inference
18
Completeness
Completeness: i is complete if whenever KB╞
α, it is also true that
KB ├i α
nAn incomplete inference
algorithm cannot reach all possible conclusions
nEquivalent to completeness
in search (chapter 3)
All possible clauses entailed
by
the KB
the KB
Clauses
inferable
from
KB using IF
Original
KB
KB