Abstract
A completeness theorem for a top-down version of a declarative error diagnoser in [1] (also in [2]), which can locate wrong answers and missing answers in arbitrary first order logic programming, has been proved in this paper.
C.R. Categories: