Guarded resolution for answer set programming

2009/04/25 by Marek, V. W., Remmel, J. B.
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.0904.3953

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.

Related

• An Application of Proof-Theory in Answer Set Programming
• Open Answer Set Programming with Guarded Programs
• Fages' Theorem and Answer Set Programming
• Verification of Locally Tight Programs
• Answer Sets and the Language of Answer Set Programming