An Application of Proof-Theory in Answer Set Programming
Artificial Intelligence
2010-01-11 v2
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.
Cite
@article{arxiv.0905.0197,
title = {An Application of Proof-Theory in Answer Set Programming},
author = {V. W. Marek and J. B. Remmel},
journal= {arXiv preprint arXiv:0905.0197},
year = {2010}
}
Comments
22 pages. Short version was published in ICLP08. New version slightly shorter than the previous version