Forgetting for Answer Set Programs Revisited
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1162-1167.
Abstract
A new semantic forgetting for answer set programs (ASP), called SM-forgetting, is proposed in the paper.It distinguishes itself from the others in that it preserves not only skeptical and credulous consequences on unforgotten variables, but also strong equivalence — forgetting same variables in strongly equivalent logic programs has strongly equivalent results. The forgetting presents a positive answer to Gabbay, Pearce and Valverde's open question — if ASP has uniform interpolation property. We also investigate some properties, algorithm and computational complexities for the forgetting. It shows that computing the forgetting result is generally intractable even for Horn logic programs.
@inproceedings{ijcai2013p175,
title = {Forgetting for Answer Set Programs Revisited},
author = {Wang, Yisong and Wang, Kewen and Zhang, Mingyi},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1162--1167},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/175},
}
TY - CPAPER TI - Forgetting for Answer Set Programs Revisited AU - Wang, Yisong AU - Wang, Kewen AU - Zhang, Mingyi T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1162 EP - 1167 UR - https://ijcai.org/proceedings/2013/175 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
