Selective Linear Definite Clause Resolution - What is the completeness of SLD resolution?

If a replacement θ exists such that P |= Q θ, then for every program P and query Q, there exists an answer substitution θ0 and a substitution θ1 such that θ = θ0 ⋦ θ1, according to the Completeness of Selective Linear Definite Clause Resolution (SLD-Resolution) theorem. To put it another way, SLD-resolution will calculate the exact response substitute or a more generic one for every query.