Guarded resolution for answer set programming
Artificial Intelligence
2010-02-21 v4
Abstract
We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.
Keywords
Cite
@article{arxiv.0904.3953,
title = {Guarded resolution for answer set programming},
author = {V. W. Marek and J. B. Remmel},
journal= {arXiv preprint arXiv:0904.3953},
year = {2010}
}
Comments
13 pages, some results added. Accepted for publication at TPLP