Guarded resolution for answer set programming
classification
💻 cs.AI
keywords
resolutionanswerapplicationscompletedescribeguardedlogicprogramming
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.