An Application of Proof-Theory in Answer Set Programming
classification
💻 cs.AI
keywords
answercharacterizationlogicprogrammingapplicationapplycontinuityformulas
read the original 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.
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.