Translating first-order theories into logic programs

Publication Type:
Conference Proceeding
Citation:
IJCAI International Joint Conference on Artificial Intelligence, 2011, pp. 1126 - 1131
Issue Date:
2011-12-01
Full metadata record
Files in This Item:
Filename Description Size
192.pdfPublished version676.31 kB
Adobe PDF
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.
Please use this identifier to cite or link to this item: