On the Equivalence between Answer Sets and Models of Completion for Nested Logic Programs
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 859-865.
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.
@inproceedings{ijcai2003p123,
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 = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {859--865},
year = {2003},
url = {https://ijcai.org/proceedings/2003/123},
}
TY - CPAPER TI - On the Equivalence between Answer Sets and Models of Completion for Nested Logic Programs AU - You, Jia-Huai AU - Yuan, Li-Yan AU - Zhang, Mingyi T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 859 EP - 865 UR - https://ijcai.org/proceedings/2003/123 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
