Guarded resolution for answer set programming

Abstract

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.

13 pages, some results added. Accepted for publication at TPLP

References in corpus (1)

• The Ultraluminous State