Guarded resolution for answer set programming

04/25/2009

∙

by   V. W. Marek, et al.

∙

0

∙

share

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.