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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.