First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 724-729.
Abstract
We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczynski. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. In the same spirit as the first-order stable model semantics proposed by Ferraris, Lee and Lifschitz, the semantics proposed here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semantics.
@inproceedings{ijcai2011p128,
title = {First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription},
author = {Bartholomew, Michael and Lee, Joohyung and Meng, Yunsong},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {724--729},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-128},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-128},
}
TY - CPAPER TI - First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription AU - Bartholomew, Michael AU - Lee, Joohyung AU - Meng, Yunsong T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 724 EP - 729 DO - 10.5591/978-1-57735-516-8/IJCAI11-128 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-128 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: