An Application of Proof-Theory in Answer Set Programming
V.W. Marek, J.B. Remmel
TL;DR
This paper explores proof-theoretic methods in answer set programming, providing new characterizations of the Gelfond-Lifschitz operator's continuity and stable models without loop formulas.
Contribution
It introduces novel proof-theoretic techniques to analyze answer set programming, offering a propositional characterization of stable models independent of loop formulas.
Findings
Characterization of Gelfond-Lifschitz operator's continuity
Propositional characterization of stable models
Elimination of loop formulas in stable model analysis
Abstract
We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic program. 2. A propositional characterization of stable models of logic programs (without referring to loop formulas.
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 · Bayesian Modeling and Causal Inference