An Application of Proof-Theory in Answer Set Programming

05/02/2009

∙

by   V. W. Marek, et al.

∙

0

∙

share

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.