Guarded resolution for answer set programming
V.W. Marek, J.B. Remmel
TL;DR
This paper introduces a new resolution rule for answer set programming that is complete for stable semantics, enhancing the theoretical foundations and potential proof methods in the field.
Contribution
It presents a novel guarded resolution rule for answer set programming that is proven complete for stable semantics, with demonstrated applications.
Findings
The guarded resolution rule is complete for stable semantics.
Applications of the rule improve proof methods in answer set programming.
The approach advances theoretical understanding of logic program semantics.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Logic, programming, and type systems