Translating First-Order Theories into Logic Programs
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1126-1130.
Abstract
This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theories under these two semantics can then be handled by using existing answer set solvers. The effectiveness of this approach in computing hard problems beyond NP is demonstrated by some experiments.
@inproceedings{ijcai2011p192,
title = {Translating First-Order Theories into Logic Programs},
author = {Zhang, Heng and Zhang, Yan and Ying, Mingsheng and Zhou, Yi},
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 = {1126--1130},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-192},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-192},
}
TY - CPAPER TI - Translating First-Order Theories into Logic Programs AU - Zhang, Heng AU - Zhang, Yan AU - Ying, Mingsheng AU - Zhou, Yi 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 - 1126 EP - 1130 DO - 10.5591/978-1-57735-516-8/IJCAI11-192 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-192 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: