Proceedings

Translating First-Order Theories into Logic Programs

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1126-1130.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-192

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.

Heng Zhang, Yan Zhang, Mingsheng Ying, and Yi Zhou. 2011. Translating First-Order Theories into Logic Programs. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1126–1130. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-192
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards