We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.
