## Towards Automated Integration of Guess and Check Programs in Answer Set Programming (2004)

### Cached

### Download Links

- [arxiv.org]
- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- DBLP

### Other Repositories/Bibliography

Venue: | LPNMR, volume 2923 of LNCS |

Citations: | 14 - 3 self |

### BibTeX

@INPROCEEDINGS{Eiter04towardsautomated,

author = {Thomas Eiter and Axel Polleres},

title = {Towards Automated Integration of Guess and Check Programs in Answer Set Programming},

booktitle = {LPNMR, volume 2923 of LNCS},

year = {2004},

pages = {100--113},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical "guess and check" nature of NP problems: The property is encoded in a way such that polynomial size certificates for it correspond to stable models of a program. However, the problem-solving capacity of full disjunctive logic programs (DLPs) is beyond NP at the second level of the polynomial hierarchy.