From Answer Set Logic Programming to Circumscription via Logic of GK
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 441-445.
Abstract
We first provide a mapping from Pearce's equilibrium logic and Ferraris and Lifschitz's general logic programs to Lin and Shoham's logic of knowledge and justified assumptions, a nonmonotonic modal logic that has been shown to include as special cases both Reiter's default logic in the propositional case and Moore's autoepistemic logic. From this mapping, we obtain a mapping from general logic programs to circumscription, both in the propositional and first-order case. Furthermore, we show that this mapping can be used to check the strong equivalence between two propositional logic programs in classical logic.
@inproceedings{ijcai2007p69,
title = {From Answer Set Logic Programming to Circumscription via Logic of GK},
author = {Lin, Fangzhen and Zhou, Yi},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {441--445},
year = {2007},
url = {https://ijcai.org/proceedings/2007/69},
}
TY - CPAPER TI - From Answer Set Logic Programming to Circumscription via Logic of GK AU - Lin, Fangzhen AU - Zhou, Yi T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 441 EP - 445 UR - https://ijcai.org/proceedings/2007/69 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
