An Application of Proof-Theory in Answer Set Programming

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.

22 pages. Short version was published in ICLP08. New version slightly shorter than the previous version