Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.5591/978-1-57735-516-8/IJCAI11-192 | IJCAI |
Keywords | Field | DocType |
existing answer set solvers,hard problem,stable model semantics,first-order theory,reasoning problem,finite structure,logic program | Discrete mathematics,Embedding,Computer science,First order,Circumscription,Stable model semantics,Well-founded semantics,Semantics,Semantics of logic | Conference |
Citations | PageRank | References |
3 | 0.38 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heng Zhang | 1 | 27 | 14.42 |
| Yan Zhang | 2 | 777 | 123.70 |
| Ying Mingsheng | 3 | 852 | 80.04 |
| Yi Zhou | 4 | 161 | 26.62 |