On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs
Abstract
We present a sufficient as well as a necessary condition for the equivalence between answer sets and models of completion for logic programs with nested expressions in the bodies of rules. This condition is the weakest among all that we are aware of even for normal logic programs. To obtain this result, we present a polynomial time reduction from this class of nested logic programs to extended programs. Consequently, answer sets for these nested programs can be computed by an answer set generator for extended programs on the one hand, and characterized in terms of models of completion on the other. 1
Cite
Text
You et al. "On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs." International Joint Conference on Artificial Intelligence, 2003.Markdown
[You et al. "On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/you2003ijcai-equivalence/)BibTeX
@inproceedings{you2003ijcai-equivalence,
title = {{On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs}},
author = {You, Jia-Huai and Yuan, Li-Yan and Zhang, Mingyi},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {859-866},
url = {https://mlanthology.org/ijcai/2003/you2003ijcai-equivalence/}
}