First page Back Continue Last page Summary Graphics
Soundness And Completeness
Sound: every CL returned by algorithm
is a solution
Complete: if a solution exists, algorithm is guaranteed to find it
C.f. Def. 2.2: ``an algorithm is complete if every solution can be found by it''
Systematic: complete + each candidate CL examined at most once